A note on Laplacian graph eigenvalues

Citations of this article
Mendeley users who have this article in their library.


Let G = (V, E) be a graph on n vertices. Denote by d(v) the degree of v ∈ V and by m(v) the average of the degrees of the vertices of G adjacent to v. Then b(G) = max{m(v) + d(v): v ∈ V} is an upper bound for the Laplacian spectral radius of G; hence, n - b(GC) is a lower bound for the algebraic connectivity of G in terms of the vertex degrees of its complement. © 1998 Elsevier Science Inc. All rights reserved.




Merris, R. (1998). A note on Laplacian graph eigenvalues. Linear Algebra and Its Applications, 285(1–3), 33–35. https://doi.org/10.1016/S0024-3795(98)10148-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free