On the Spectrum of Laplacian Matrix
Keyword(s):
Let G be a simple graph of order n . The matrix ℒ G = D G − A G is called the Laplacian matrix of G , where D G and A G denote the diagonal matrix of vertex degrees and the adjacency matrix of G , respectively. Let l 1 G , l n − 1 G be the largest eigenvalue, the second smallest eigenvalue of ℒ G respectively, and λ 1 G be the largest eigenvalue of A G . In this paper, we will present sharp upper and lower bounds for l 1 G and l n − 1 G . Moreover, we investigate the relation between l 1 G and λ 1 G .
Keyword(s):
Keyword(s):
2019 ◽
Vol 11
(01)
◽
pp. 1950001
Keyword(s):
Keyword(s):
2020 ◽
Vol 36
(36)
◽
pp. 214-227
◽
2008 ◽
Vol Vol. 10 no. 1
(Graph and Algorithms)
◽
Keyword(s):
2019 ◽
Vol 25
(3)
◽
pp. 302-313
Keyword(s):