Signed graphs with all but two eigenvalues equal to \(\pm 1\)

DOI10.1007/S00373-023-02682-4zbMath1525.05069OpenAlexW4384825793MaRDI QIDQ6166672

De-Qiong Li, Yao-Ping Hou, Dijian Wang

Publication date: 3 August 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02682-4

zbMATH Keywords

signed graphsfriendship graphadjacency eigenvaluesspectral determination

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of graphs
• On the two largest \(Q\)-eigenvalues of graphs
• Which graphs are determined by their spectrum?
• Signed graphs cospectral with the path
• Spectral characterizations of signed cycles
• Signed graphs with three eigenvalues: biregularity and beyond
• More on signed graphs with at most three eigenvalues
• Integral signed subcubic graphs
• Spectral characterization of mixed extensions of small graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• Spectral characterizations of signed lollipop graphs
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• Matrices in the Theory of Signed Simple Graphs
• Signed graphs with at most three eigenvalues
• Connected signed graphs L-cospectral to signed ∞-graphs
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)

This page was built for publication: Signed graphs with all but two eigenvalues equal to \(\pm 1\)