On signed graphs with at most two eigenvalues unequal to $\pm 1$

Willem H. Haemers, Hatice Topcu

We present the first steps towards the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to 1 or -1. Here we deal with the…