TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS
2011 ◽
Vol 03
(02)
◽
pp. 185-191
◽
Keyword(s):
The signless Laplacian matrix of a 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.
2019 ◽
Vol 35
(1)
◽
pp. 31-40
◽
2018 ◽
Vol 34
◽
pp. 191-204
◽
2018 ◽
Vol 10
(03)
◽
pp. 1850035
◽
2013 ◽
Vol 439
(8)
◽
pp. 2442-2447
◽
2016 ◽
Vol 36
(4)
◽
pp. 977
◽
2013 ◽
Vol 219
(10)
◽
pp. 5025-5032
◽
Keyword(s):