Signed graphs with all but two eigenvalues equal to \(\pm 1\) (Q6166672)

\textit{S. M. Cioabă} et al. [J. Algebr. Comb. 41, No. 3, 887--897 (2015; Zbl 1317.05111)] determined the graphs whose adjacency matrices have at most two eigenvalues different from \(\pm1\). These results were partially extended in a recent paper by \textit{W. H. Haemers} and \textit{H. Topcu} [Linear Algebra Appl. 670, 68--77 (2023; Zbl 1514.05068)] who partially determined the signed graphs whose adjacency matrices have at most two eigenvalues different from \(\pm1\). The present authors expand and complete the results of Haemers and Tupcu [loc. cit.], by completely determining the signed graphs whose adjacency matrices have at most two eigenvalues different from \(\pm1\). These are the signed graphs equivalent to the graphs determined by Cioabă et al. [loc. cit.], as well as other infinite families of signed graphs and individual signed graphs. As an application of these results, the authors solve the problem of determining which signed friendship graphs \(F_k\) are determined by their adjacency matrix eigenvalue spectrum. This problem was introduced for (unsigned) friendship graphs in [\textit{J. Wang} et al., Discrete Math. 310, No. 21, 2858--2866 (2010; Zbl 1208.05079)] and was solved by Cioabă et al. [loc. cit.] in the paper referenced above; these results are extended by the present paper.