Upper bound for the Laplacian eigenvalues of a graph

arXiv1106.0769MaRDI QIDQ6225816FDOQ6225816

Miriam Farber, Ido Kaminer

Publication date: 3 June 2011

Abstract: In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_m(G)$ and $lambd{a}_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest Laplacian eigenvalue of $G$ respectively. Then $lambd{a}_{m+1}(G)leq{d}_m(G)+m-1$ for $$. We also introduce upper and lower bound for the Laplacian eigenvalues of weighted graphs, and compare it with the special case of unweighted graphs.

This page was built for publication: Upper bound for the Laplacian eigenvalues of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6225816)