The minimum spectral radius of graphs with a given independence number

DOI10.1016/j.laa.2009.03.055zbMath1168.05335OpenAlexW2103423788MaRDI QIDQ1030756

Mimi Xu, Yuan Hong, Jin-Long Shu, Ming-qing Zhai

Publication date: 2 July 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.03.055

zbMATH Keywords

trianglespectral radiusindependence numberclique number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (13)

Unnamed Item ⋮ Disproof of a conjecture on the minimum spectral radius and the domination number ⋮ On minimally 2-(edge)-connected graphs with extremal spectral radius ⋮ On the spectral radius of trees with given independence number ⋮ The minimum spectral radius of graphs with a given domination number ⋮ Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number ⋮ On spectral extrema of graphs with given order and dissociation number ⋮ The minimal spectral radius with given independence number ⋮ On the spectral radius of bi-block graphs with given independence number \(\alpha\) ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ The minimum signless Laplacian spectral radius of graphs with given independence number ⋮ The spectral radius of graphs with given independence number ⋮ GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimal spectral radius of graphs with a given diameter
• Spectral bounds for the clique and independence numbers of graphs
• The spectral radius of trees on \(k\) pendant vertices
• A sharp upper bound of the spectral radius of graphs
• Bounds on graph eigenvalues. II
• Laplacian spectral bounds for clique and independence numbers of graphs
• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• Ordering trees by their largest eigenvalues

This page was built for publication: The minimum spectral radius of graphs with a given independence number