The signed graphs with two eigenvalues unequal to 1
Abstract
We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.