Abstract
We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to ±1. The unsigned graphs and the disconnected, the bipartite and the complete signed graphs with this property have already been determined in two earlier papers. Here we deal with the remaining cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
