Spectral characterization of the complete graph removing a cycle
From MaRDI portal
Publication:6126164
DOI10.1016/j.jcta.2024.105868WikidataQ128193862 ScholiaQ128193862MaRDI QIDQ6126164
Zoran Stanić, Muhuo Liu, Hai-Ying Shan, Xiaofeng Gu
Publication date: 9 April 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral characterizations of almost complete graphs
- Spectra of graphs
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Spectral characterization of the complete graph removing a path
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
- Discrete hyperbolic geometry
- On graphs with exactly one eigenvalue less than -1
- The second largest eigenvalue of a tree
- Which graphs are determined by their spectrum?
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- Spectral characterization of the complete graph removing a path of small length
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- A sharp upper bound of the spectral radius of graphs
- The complement of the path is determined by its spectrum
- Interlacing eigenvalues and graphs
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- On graphs whose second largest eigenvalue is at most 1
- Reflexive bipartite regular graphs
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture
- Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
- On the nullity of graphs
- On regular graphs and coronas whose second largest eigenvalue does not exceed 1
- Reflexive cacti: A survey
This page was built for publication: Spectral characterization of the complete graph removing a cycle
