The signed graphs with two eigenvalues unequal to \(\pm 1\)

DOI10.1016/J.AMC.2023.128348arXiv2301.01623MaRDI QIDQ6069367

Willem H. Haemers, Hatice Topcu

Publication date: 14 November 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.01623

zbMATH Keywords

signed graphgraph spectrumspectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Combinatorial designs with two singular values. I: Uniform multiplicative designs
• Spectra of graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• Open problems in the spectral theory of signed graphs
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)
• Signed graphs with all but two eigenvalues equal to \(\pm 1\)

This page was built for publication: The signed graphs with two eigenvalues unequal to \(\pm 1\)