TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS

DOI10.1142/S1793830911001152zbMath1222.05149OpenAlexW1971843236MaRDI QIDQ3087094

Rong-Ying Pan, Ya-Hong Chen, Xiao Dong Zhang

Publication date: 2 August 2011

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

Full work available at URL: https://doi.org/10.1142/s1793830911001152

zbMATH Keywords

graphspectral radiusadjacency matrixsignless Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs ⋮ Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications ⋮ Sharp bounds for the spectral radius of nonnegative matrices ⋮ A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues ⋮ A sharp upper bound for the spectral radius of a nonnegative matrix and applications

Cites Work

• Unnamed Item
• The Laplacian spectrum of a mixed graph
• Signless Laplacians of finite graphs
• The Laplacian spectral radii of trees with degree sequences
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• The signless Laplacian spectral radius of graphs with given degree sequences
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Bounds on the index of the signless Laplacian of a graph
• Bounds and conjectures for the signless Laplacian index of graphs
• 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

This page was built for publication: TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS