Maximum spectral radius of graphs with given connectivity, minimum degree and independence number

DOI10.1016/j.jda.2014.08.006zbMath1325.05107arXiv1107.5359OpenAlexW2043005319MaRDI QIDQ2018544

Hongliang Lu, Yu-qing Lin

Publication date: 24 March 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.5359

zbMATH Keywords

independence numberconnectivitymaximum spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (5)

On the spectral radius of trees with given independence number ⋮ On the spectral radius of block graphs with prescribed independence number \(\alpha\) ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) ⋮ On the spectral radius of bi-block graphs with given independence number \(\alpha\) ⋮ On the spectral radius of block graphs having all their blocks of the same size

Cites Work

• On the spectral radius of graphs with connectivity at most \(k\)
• Spectral radius of graphs with given matching number
• Extreme eigenvalues of nonregular graphs
• On the first eigenvalue of bipartite graphs
• Spectral bounds for the clique and independence numbers of graphs
• The spectral radius of trees on \(k\) pendant vertices
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• Interlacing eigenvalues and graphs
• The spectral radius and the maximum degree of irregular graphs
• On the largest eigenvalue of non-regular graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• More on Graph Perturbations
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones

This page was built for publication: Maximum spectral radius of graphs with given connectivity, minimum degree and independence number