2000 character limit reached
The spectral radius of unbalanced signed graphs without negative $C_3$ or $C_4$
Published 22 Jul 2024 in math.CO | (2407.15898v1)
Abstract: A signed graph is a graph in which every edge carries a $+$ or a $-$ sign. In this paper, we determine the signed graphs with maximum spectral radius among all unbalanced signed graphs with fixed order that contain neither negative three-cycles nor negative four-cycles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.