Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number

By Bian He, Ya-Lei Jin, Xiaodong Zhang. 2012

69 citations recorded by the source corpus.

Abstract In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized. In addition, these results disprove the two conjectures on the signless Laplacian spectral radius in [8] .

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Inorganic Chemistry

View Paper: https://www.semanticscholar.org/paper/d934df045f8118040a7acdce586eebe6f1e6c4df