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

DOI10.1016/J.LAA.2023.01.021MaRDI QIDQ2689158zbMATH OpenOpenAlexFDO

Authors Yongang Wang, Dan Li, Huiqiu Lin

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

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

Recommendations

• Signed graphs with all but two eigenvalues equal to 1
• More on signed graphs with at most three eigenvalues
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)
• Signed graphs with at most three eigenvalues
• Signed graphs with least eigenvalue \(<-2\)
• scientific article; zbMATH DE number 4041958
• On regular signed graphs with three eigenvalues
• scientific article; zbMATH DE number 6004041
• Graphs with at most one signless Laplacian eigenvalue exceeding three
• Some graphs with exactly three non-negative eigenvalues

Cites work

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

Cited in

(8)

• scientific article; zbMATH DE number 6004041 (Why is no real title available?)
• scientific article; zbMATH DE number 398956 (Why is no real title available?)
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• Signed graphs with at most three eigenvalues
• The signed graphs with two eigenvalues unequal to \(\pm 1\)
• Signed graphs with all but two eigenvalues equal to 1
• Eigenpairs of adjacency matrices of balanced signed graphs
• On signed graphs with at most three positive eigenvalues

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689158)