The minimum signless Laplacian spectral radius of graphs with given independence number

DOI10.1016/J.LAA.2010.06.008zbMath1211.05075OpenAlexW2036399182MaRDI QIDQ710876

Ruilin Li, Jin-Song Shi

Publication date: 22 October 2010

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

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

zbMATH Keywords

spectral radiusindependence numbersignless Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index ⋮ The \(Q\)-minimizer graph with given independence number ⋮ Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number

Cites Work

• Signless Laplacians of finite graphs
• Unoriented Laplacian maximizing graphs are degree maximal
• On graphs whose signless Laplacian index does not exceed 4.5
• The minimum spectral radius of graphs with a given independence number
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• Laplacian matrices of graphs: A survey
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Sharp upper bounds for the Laplacian graph eigenvalues
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• Towards a spectral theory of graphs based on the signless Laplacian, I
• A characterization of the smallest eigenvalue of a graph
• Unnamed Item
• Unnamed Item

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