A tight lower bound on the matching number of graphs via Laplacian eigenvalues

Xiaofeng Gu, Muhuo Liu

Let ${\alpha }^{\prime }$ and ${\mu }_i$ denote the matching number of a non-empty simple graph $G$ with $n$ vertices and the $i$-th smallest eigenvalue of its Laplacian matrix, respectively. In this pa…