On signed graphs whose spectral radius does not exceed \(\sqrt{2 + \sqrt{5}}\) (Q2699926)

The theory of limit points for the spectral radius of graph sequences studied by \textit{A. J. Hoffman} [Lect. Notes Math. 303, 165--172 (1972; Zbl 0297.15016)] is still valid in the context of signed graphs. The Hoffman program with respect to any real or complex square matrix \(M\) associated with a graph \(G\) stems from Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs when this radius does not exceed \(2+\sqrt 5\). A signed graph \(G=(G,\sigma)\) is a pair \((G,\sigma)\), where \(G=(V(G),E(G))\) is a simple graph and \(\sigma:E(G)\to\{+1,-1\}\) is the sign function. The authors specified positive edges are depicted as bold lines and negative edges are depicted as dashed lines. This article studies the Hoffman program of signed graphs. All signed graphs whose spectral radius does not exceed \(2+\sqrt 5\) are identified. This article contains many interesting, inspiring, and useful contents. It will be useful to researchers working in the field of computer programming and signed graph researchers.