Sharp bounds for the signless Laplacian spectral radius in terms of clique number

被引:40
|
作者
He, Bian [1 ]
Jin, Ya-Lei [1 ]
Zhang, Xiao-Dong [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Math, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Signless Laplacian spectral radius; Clique number; Turan graph; GRAPHS; EIGENVALUES; THEOREM;
D O I
10.1016/j.laa.2011.10.008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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]. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:3851 / 3861
页数:11
相关论文
共 50 条