The graphs with all but two eigenvalues equal to $\pm 1$

Sebastian M. Cioabă, Willem H. Haemers, Jason Vermette +1

We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $\pm 1$ and decide which of these graphs are determined by their…