On tricyclic graphs whose second largest eigenvalue does not exceed 1
From MaRDI portal
Publication:632473
DOI10.1016/J.LAA.2010.12.023zbMath1216.05076OpenAlexW1997992024MaRDI QIDQ632473
Publication date: 25 March 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.12.023
Related Items (7)
A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ Graphs with second largest eigenvalue less than 1/2 ⋮ Unnamed Item ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ The \(T_{1,2}\)-free planar graphs whose second largest eigenvalue does not exceed 1 ⋮ The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices
- On tricyclic graphs of a given diameter with minimal energy
- On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
- On nested split graphs whose second largest eigenvalue is less than 1
- The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices
- On the index of tricyclic graphs with perfect matchings
- Sharp lower bounds on the eigenvalues of trees
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- The Laplacian spread of tricyclic graphs
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- On regular graphs and coronas whose second largest eigenvalue does not exceed 1
This page was built for publication: On tricyclic graphs whose second largest eigenvalue does not exceed 1
