On generalized -graphs whose second largest eigenvalue does not exceed 1
From MaRDI portal
Publication:998477
DOI10.1016/J.DISC.2007.10.017zbMATH Open1225.05162OpenAlexW1998994159MaRDI QIDQ998477FDOQ998477
Authors: Mingfei Gao, Qiongxiang Huang
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.017
Recommendations
Cites Work
- Title not available (Why is that?)
- The second largest eigenvalue of a tree
- Title not available (Why is that?)
- The largest eigenvalue of a graph: A survey
- On graphs with exactly one eigenvalue less than -1
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- Title not available (Why is that?)
Cited In (11)
- A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph
- Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
- Spectral characterization of graphs whose second largest eigenvalue is less than 1
- Title not available (Why is that?)
- Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- On graphs whose second largest eigenvalue is at most 1
- Planar graphs whose second largest eigenvalue smaller than \(\frac{\sqrt{5}-1}{2}\)
- Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
- The \(T_{1,2}\)-free planar graphs whose second largest eigenvalue does not exceed 1
- Spectral characterization of the complete graph removing a cycle
This page was built for publication: On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998477)