The graphs with all but two eigenvalues equal to-2 or 0

摘要

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.