The signed graphs with two eigenvalues unequal to 1

DOI10.1016/J.AMC.2023.128348MaRDI QIDQ6069367zbMATH OpenFDO

Authors 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

graph spectrumsigned graphspectral characterization

Mathematics Subject Classification ID

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

Abstract: We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to $pm1$. 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.

Recommendations

• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)
• The signed graphs with all but at most three eigenvalues equal to \(-1\)
• Signed graphs with all but two eigenvalues equal to \(\pm 1\)
• On signed graphs with just two distinct adjacency eigenvalues
• On signed graphs with two distinct eigenvalues

Cites work

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

Cited in

(3)

• Eigenpairs of adjacency matrices of balanced signed graphs
• Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum
• 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\)

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