The sharp lower bound for the spectral radius of connected graphs with the independence number

DOI10.11650/tjm.19.2015.4314zbMath1357.05083OpenAlexW2052767272MaRDI QIDQ514853

Ya-Lei Jin, Xiao Dong Zhang

Publication date: 9 March 2017

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm.19.2015.4314

zbMATH Keywords

spectral radiusindependence numberPerron vectorclique tree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (4)

On spectral extrema of graphs with given order and dissociation number ⋮ The minimal spectral radius with given independence number ⋮ The spectral radius of graphs with given independence number ⋮ On a conjecture about the spectral radius of block graphs

Cites Work

• On bounds for some graph invariants
• More spectral bounds on the clique and independence numbers
• Bounds on graph eigenvalues. II
• Cliques and the spectral radius
• GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS
• Turán's theorem and k‐connected graphs

This page was built for publication: The sharp lower bound for the spectral radius of connected graphs with the independence number