A new upper bound for the spectral radius of graphs with girth at least 5
From MaRDI portal
Publication:2369050
DOI10.1016/j.laa.2005.10.043zbMath1102.05038OpenAlexW2101597246MaRDI QIDQ2369050
Feng Tian, Mei Lu, Huiqing Liu
Publication date: 28 April 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.10.043
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (11)
Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs ⋮ Bounds on graph eigenvalues. I ⋮ The maximum spectral radius of wheel-free graphs ⋮ The spectral Turán problem about graphs with no 6-cycle ⋮ A Spectral Erdős-Sós Theorem ⋮ On the signless Laplacian spectral radius of irregular graphs ⋮ Spectral Turán problems for intersecting even cycles ⋮ The spectral radius of graphs with no odd wheels ⋮ Bounds for the Laplacian spectral radius of graphs ⋮ A spectral condition for the existence of a pentagon in non-bipartite graphs ⋮ Spectral extrema of graphs: forbidden hexagon
Cites Work
- Unnamed Item
- Spektren endlicher Grafen
- On the spectral radius of (0,1)-matrices
- A bound on the spectral radius of graphs
- Bounds of eigenvalues of graphs
- Bounds on eigenvalues and chromatic numbers
- Sharp upper bounds on the spectral radius of graphs
- A bound on the spectral radius of graphs with \(e\) edges
- Some new bounds on the spectral radius of graphs
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius of graphs with cut vertices
- Matrix Analysis
This page was built for publication: A new upper bound for the spectral radius of graphs with girth at least 5