GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS

DOI10.1142/S1793830913500171zbMath1276.05061MaRDI QIDQ2864859

Xue Du, Ling-Sheng Shi

Publication date: 26 November 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

spectral radiusindependence numberclique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

On the spectral radius of trees with given independence number ⋮ On spectral extrema of graphs with given order and dissociation number ⋮ The minimal spectral radius with given independence number ⋮ The sharp lower bound for the spectral radius of connected graphs with the independence number ⋮ Packing triangles in \(K_4\)-free graphs ⋮ On the spectral radius of block graphs having all their blocks of the same size ⋮ The spectral radius of graphs with given independence number

Cites Work

• Spektren endlicher Grafen
• The minimum spectral radius of graphs with a given independence number
• 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
• Minimizing the Laplacian spectral radius of trees with given matching number

This page was built for publication: GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS