Sharp Upper Bounds for the Laplacian Spectral Radius of Graphs
2013 ◽
Vol 2013
◽
pp. 1-4
◽
Keyword(s):
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical problems associated with the network, from transient stability analysis of power network to distributed control of formations. LetG=(V,E)be a simple connected graph onnvertices and letμ(G)be the largest Laplacian eigenvalue (i.e., the spectral radius) ofG. In this paper, by using the Cauchy-Schwarz inequality, we show that the upper bounds for the Laplacian spectral radius ofG.
2011 ◽
Vol 03
(02)
◽
pp. 185-191
◽
2019 ◽
Vol 35
(1)
◽
pp. 31-40
◽
2014 ◽
Vol 06
(02)
◽
pp. 1450029
◽
2016 ◽
Vol 36
(4)
◽
pp. 977
◽
2018 ◽
Vol 34
◽
pp. 459-471
◽
Keyword(s):
2018 ◽
Vol 34
◽
pp. 191-204
◽
2013 ◽
Vol 219
(10)
◽
pp. 5025-5032
◽
Keyword(s):