A new upper bound for the spectral radius of graphs with girth at least 5

DOI10.1016/J.LAA.2005.10.043zbMATH Open1102.05038OpenAlexW2101597246MaRDI QIDQ2369050FDOQ2369050

Authors: Mei Lu, Huiqing Liu, Feng Tian 

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

Recommendations

• A sharp upper bound of the spectral radius of graphs
• On the spectral radii of graphs without given cycles
• A bound on the spectral radius of graphs
• Sharp upper bounds on the spectral radius of graphs
• A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size

zbMATH Keywords

Perron-eigenvector

Mathematics Subject Classification ID

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

Cites Work

• Matrix Analysis
• A sharp upper bound of the spectral radius of graphs
• On the spectral radius of (0,1)-matrices
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• Spektren endlicher Grafen
• A bound on the spectral radius of graphs
• Bounds of eigenvalues of graphs
• Title not available (Why is that?)
• A bound on the spectral radius of graphs with \(e\) edges
• Bounds on eigenvalues and chromatic numbers
• Sharp upper bounds on the spectral radius of graphs

Cited In (16)

• The spectral radius of graphs with no odd wheels
• Bounds for the Laplacian spectral radius of graphs
• The maximum spectral radius of wheel-free graphs
• Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
• A Spectral Erdős-Sós Theorem
• Bounds on graph eigenvalues. I
• The spectral even cycle problem
• On the spectral radii of graphs without given cycles
• On the signless Laplacian spectral radius of irregular graphs
• Spectral Turán problems for intersecting even cycles
• A spectral condition for the existence of a pentagon in non-bipartite graphs
• A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
• On the spectral radius of graphs with given maximum degree and girth
• The spectral Turán problem about graphs with no 6-cycle
• Title not available (Why is that?)
• Spectral extrema of graphs: forbidden hexagon

This page was built for publication: A new upper bound for the spectral radius of graphs with girth at least 5

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369050)