Graphs with the minimum spectral radius for given independence number

DOI10.1016/j.disc.2024.114265MaRDI QIDQ6646392

Yarong Hu, Zhenzhen Lou, Qiong Xiang Huang

Publication date: 2 December 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independence numberminimum spectral radiusminimizer graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Integral trees of arbitrarily large diameters
• Spectral radius of graphs with given matching number
• The minimal spectral radius of graphs with a given diameter
• On the spectral radius of trees with given independence number
• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• Trees with minimal index and diameter at most four
• A lower bound for the spectral radius of graphs with fixed diameter
• Graphs with given diameter maximizing the spectral radius
• The minimum spectral radius of graphs with a given independence number
• Asymptotic results on the spectral radius and the diameter of graphs
• Graphs with diameter \(n - e\) minimizing the spectral radius
• The spectral radius of trees on \(k\) pendant vertices
• The spectral radius of graphs with given independence number
• Bounds on graph eigenvalues. II
• On the spectral radius of graphs with a given domination number
• On bags and bugs
• GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS
• The minimal spectral radius with given independence number
• Spectra of graphs. Theory and application

This page was built for publication: Graphs with the minimum spectral radius for given independence number