On a lower bound for the Laplacian eigenvalues of a graph

Gary R. W. Greaves, Akihiro Munemasa, Anni Peng

If ${\mu }_m$ and $d_m$ denote, respectively, the $m$-th largest Laplacian eigenvalue and the $m$-th largest vertex degree of a graph, then ${\mu }_m⩾d_m-m+2$. This inequality was…