The signed graphs with all but at most three eigenvalues equal to \(-1\)

DOI10.1016/j.laa.2023.01.021OpenAlexW4319033773MaRDI QIDQ2689158

Huiqiu Lin, Yongang Wang, Dan Li

Publication date: 9 March 2023

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2023.01.021

zbMATH Keywords

multiplicitysigned graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• Spectral characterizations of almost complete graphs
• Which graphs are determined by their spectrum?
• On signed graphs with just two distinct adjacency eigenvalues
• A characterization of signed planar graphs with rank at most 4
• On the rank of weighted graphs
• Spectral criterion for cycle balance in networks
• On the eigenvalues of signed complete graphs
• On the Laplacian Eigenvalues of Signed Graphs
• Open problems in the spectral theory of signed graphs

This page was built for publication: The signed graphs with all but at most three eigenvalues equal to \(-1\)