On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)

DOI10.1016/j.dam.2024.04.004zbMATH Open1540.05113MaRDI QIDQ6546419

Mengsi Chen, Shaowei Sun

Publication date: 29 May 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixclaw-free graphspectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• On the third largest eigenvalue of graphs
• Spectral characterizations of almost complete graphs
• A characterization of graphs with rank 5
• A characterization of graphs with rank 4
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• Graphs with three distinct eigenvalues and largest eigenvalue less than 8
• On graphs with exactly one eigenvalue less than -1
• Nonregular graphs with three eigenvalues
• A complete characterization of graphs with exactly two positive eigenvalues
• Spectral characterization of mixed extensions of small graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• On the nullity of graphs
• Graphs with Exactly Two Negative Eigenvalues
• On graphs with exactly two positive eigenvalues
• Characterization of graphs with exactly two non-negative eigenvalues
• GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
• The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

This page was built for publication: On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)