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.

Cited by in corpus (2)

• Graphs with many valencies and few eigenvalues
• Connected graphs cospectral with a Friendship graph