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

被引：7
|
作者：
Chen, Ya-Hong [1 ]
Pan, Rong-Ying [2 ]
Zhang, Xiao-Dong [3 ]
机构：
[1] Lishui Univ, Teacher Educ Coll, Lishui 323000, Zhejiang, Peoples R China
[2] Suzhou Vocat Univ, Suzhou 210000, Jiangsu, Peoples R China
[3] Shanghai Jiao Tong Univ, Dept Math, Shanghai 200240, Peoples R China
来源：
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2011年 / 3卷 / 02期
关键词：
Signless Laplacian matrix; spectral radius; graph; adjacencymatrix;
D O I：
10.1142/S1793830911001152
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The signless Laplacian matrix graph is the sum of its degree diagonal and adjacency matrices. In this paper, we present a sharp upper bound for the spectral radius of the adjacency matrix of a graph. Then this result and other known results are used to obtain two new sharp upper bounds for the signless Laplacian spectral radius. Moreover, the extremal graphs which attain an upper bound are characterized.
引用
收藏
页码：185 / 191
页数：7
相关论文
共 50 条
12345