A new upper bound for the Laplacian spectral radius of graphs

被引:24
作者
Guo, JM [1 ]
机构
[1] Tongji Univ, Dept Math Appl, Shanghai 200092, Peoples R China
[2] Univ Petroleum, Dept Math, Dongying 257061, Peoples R China
关键词
graph; Laplacian spectral radius; eigenvector;
D O I
10.1016/j.laa.2004.10.022
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G = (V, E) be a graph on n vertices. Denote by d(i) = d(V-i) the degree of v(i) is an element of V(G). Then lambda(G) <= max {d(i) + root d(i)(2) + 8d(i)m(i)(')/2, v(i) is an element of V(G)}, where m(i)(') = Sigma v(i)v(j)is an element of(d(j) -vertical bar N-i boolean AND N-j vertical bar)/d(j), vertical bar N-i boolean AND N-j vertical bar is the number of common neighbors of v(i) and v(j). Moreover, equality holds if and only G is a bipartite regular graph. (c) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码:61 / 66
页数:6
相关论文
共 11 条
[1]  
Anderson W. N., 1985, Linear Multilinear Algebra, V18, P141, DOI [10.1080/03081088508817681, DOI 10.1080/03081088508817681]
[2]   A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs [J].
Das, KC .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 376 :173-186
[3]   An improved upper bound for Laplacian graph eigenvalues [J].
Das, KC .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 368 :269-278
[4]   On the Laplacian eigenvalues of a graph [J].
Li, JS ;
Zhang, XD .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 285 (1-3) :305-307
[5]  
Li JS, 1997, LINEAR ALGEBRA APPL, V265, P93
[6]   de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph [J].
Li, JS ;
Pan, YL .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2001, 328 (1-3) :153-160
[7]   On the Laplacian spectral radius of a graph [J].
Liu, HQ ;
Lu, M ;
Tian, F .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 376 :135-141
[8]   A note on Laplacian graph eigenvalues [J].
Merris, R .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 285 (1-3) :33-35
[9]   An always nontrivial upper bound for Laplacian graph eigenvalues [J].
Rojo, O ;
Soto, R ;
Rojo, H .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2000, 312 (1-3) :155-159
[10]   A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph [J].
Shu, JL ;
Hong, Y ;
Wen-Ren, K .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2002, 347 (1-3) :123-129