Bounds on the (Laplacian) spectral radius of graphs

被引:41
作者
Shi, Lingsheng [1 ]
机构
[1] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China
关键词
spectral radius; Laplacian spectral radius; Nordhaus-Gaddum type; LARGEST EIGENVALUE; SHARP UPPER;
D O I
10.1016/j.laa.2006.12.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph and its Laplacian spectral radius is the largest eigenvalue of the Laplacian matrix which is the difference of the diagonal matrix of vertex degrees and the adjacency matrix. Some sharp bounds are obtained for the (Laplacian) spectral radii of connected graphs. As consequences, some (sharp) upper bounds of the Nordhaus-Gaddum type are also obtained for the sum of (Laplacian) spectral radii of a connected graph and its connected complement. (c) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:755 / 770
页数:16
相关论文
共 23 条