Lower bounds on the (Laplacian) spectral radius of weighted graphs

Abstract

The weighted graphs, where the edge weights are positive numbers, are considered. The authors obtain some lower bounds on the spectral radius and the Laplacian spectral radius of weighted graphs, and characterize the graphs for which the bounds are attained. Moreover, some known lower bounds on the spectral radius and the Laplacian spectral radius of unweighted graphs can be deduced from the bounds.

Keywords

Weighted graphs / Adjacency matrix / Laplacian matrix / Spectral radius, Lower bounds

References

[1] Anderson W N, Morley T D. Eigenvalues of the Laplacian of a graph. Linear and Multilinear Algebra, 1985, 18: 141-145

[2] Bapat R B, Raghavan T E S. Nonnegative Matrix and Applications, 1997, Cambridge: Cambridge University Press

[3] Cvetković D, Doob M, Sachs H. Spectra of Graphs-Theory and Application, 1980, New York: Academic Press

[4] Das K C. Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs. Linear Algebra and Its Applications, 2007, 427: 55-69

[5] Das K C, Bapat R B. A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs. Linear Algebra and Its Applications, 2005, 409: 153-165

[6] Das K C, Bapat R B. A sharp upper bound on the spectral radius of weighted graphs. Discrete Mathematics, 2008, 308: 3180-3186

[7] Das K C, Kumar P. Some new bounds on the spectral radius of graphs. Discrete Mathematics, 2004, 281: 149-161

[8] Guo J M. A new upper bounds for the Laplacian spectral radius of graphs. Linear Algebra and Its Applications, 2005, 400: 61-66

[9] Hofmeister M. Spectral radius and degree sequence. Math. Nachr., 1988, 139: 37-44

[10] Hong Y, Zhang X D. Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees. Discrete Mathematics, 2005, 296: 187-197

[11] Li J S, Zhang X D. On the Laplacian eigenvalues of a graph. Linear Algebra and Its Applications, 1998, 285: 305-307

[12] Liu H Q, Lu M, Tian F. On the Laplacian spectral radius of a graph. Linear Algebra and Its Applications, 2004, 376: 135-141

[13] Merris R. Laplacian matrices of graphs: A survey. Linear Algebra and Its Applications, 1994, 197–198: 143-176

[14] Rojo O. A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs. Linear Algebra and Its Applications, 2007, 420: 625-633

[15] Rojo O, Soto R, Rojo H. An always nontrivial upper bound for Laplacian graph eigenvalues. Linear Algebra and Its Applications, 2000, 312: 155-159

[16] Shu J L, Hong Y, Kai W R. A sharp bound on the largest eigenvalue of the Laplacian matrix of a graph. Linear Algebra and Its Applications, 2002, 347: 123-129

[17] Sorgun S, Büyükköse S. The new upper bounds on the spectral radius of weighted graphs. Applied Mathematics and Computation, 2012, 218: 5231-5238

[18] Tan S W. On the Laplacian spectral radius of weighted trees with a positive weight set. Discrete Mathematics, 2010, 310: 1026-1036

[19] Yang H Z, Hu G Z, Hong Y. Bounds of spectral radii of weighted trees. Tsinghua Science and Technology, 2003, 8: 517-520

[20] Yu A M, Lu M, Tian F. On the spectral radius of graphs. Linear Algebra and Its Applications, 2004, 387: 41-49

[21] Zhang X D. Two sharp upper bound for the Laplacian eigenvalues. Linear Algebra and Its Applications, 2004, 376: 207-213