2000 character limit reached
The signed graphs with two eigenvalues unequal to $\pm 1$
Published 4 Jan 2023 in math.CO | (2301.01623v1)
Abstract: We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to $\pm 1$. The unsigned graphs and the disconnected, the bipartite and the complete signed graphs with this property have already been determined in two earlier papers. Here we deal with the remaining cases.
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.