The graphs with all but two eigenvalues equal to -2 or 0
Abstract
We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to -2, or 0, and determine which of these graphs are determined by their adjacency spectrum.
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.