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

DOI10.1016/J.LAA.2010.06.008MaRDI QIDQ710876zbMATH OpenOpenAlexFDO

Authors 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 radiussignless Laplacian matrixindependence number

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)

Recommendations

• The minimum spectral radius of graphs with a given independence number
• Graphs with small independence number minimizing the spectral radius
• The spectral radius of graphs with given independence number
• The smallest signless Laplacian spectral radius of graphs with a given clique number
• Maximal signless Laplacian spectral radius of bicyclic graphs with given independence number

Cites work

• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A characterization of the smallest eigenvalue of a graph
• Enumeration of cospectral graphs.
• Laplacian matrices of graphs: A survey
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• On graphs whose signless Laplacian index does not exceed 4.5
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Sharp upper bounds for the Laplacian graph eigenvalues
• Signless Laplacians of finite graphs
• The minimum spectral radius of graphs with a given independence number
• The signless Laplacian spectral radius of graphs with given chromatic number
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Unoriented Laplacian maximizing graphs are degree maximal
• Which graphs are determined by their spectrum?

Cited in

(11)

• The \(Q\)-minimizer graph with given independence number
• Graphs with the minimum spectral radius for given independence number
• Graphs with small independence number minimizing the spectral radius
• The minimal spectral radius with given independence number
• Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
• The spectral radius of graphs with given independence number
• The minimum spectral radius of signless Laplacian of graphs with a given clique number
• The sharp lower bound for the spectral radius of connected graphs with the independence number
• The minimum spectral radius of graphs with a given independence number
• The minimal signless Laplacian spectral radius of graphs with diameter \(n-4\)
• Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710876)