Summary: Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We firstly give a sharp bound for $m_{G}(\mu )$, the multiplicity of a Laplacian eigenvalue $\mu $ of $G$. As a straightforward result, $m_{U}(1)\le n-2$. We then provide two graph operations (i.e., grafting and shifting) on graph $G$ for which the value of $m_{G}(1)$ is nondecreasing. As applications, we get the distribution of $m_{U}(1)$ for unicyclic graphs on $n$ vertices. Moreover, for the two largest possible values of $m_{U}(1)\in \{n-5,n-3\}$, the corresponding graphs $U$ are completely determined.
[3] Andrade, E., Cardoso, D. M., Pastén, G., Rojo, O.: On the Faria's inequality for the Laplacian and signless Laplacian spectra: A unified approach. Linear Algebra Appl. 472 (2015), 81-86. DOI 10.1016/j.laa.2015.01.026 | MR 3314367 | Zbl 1307.05136
[6] Cvetković, D. M., Rowlinson, P., Simić, S.: An Introduction to the Theory of Graph Spectra. London Mathematical Society Student Texts 75. Cambridge University Press, Cambridge (2010). DOI 10.1017/CBO9780511801518 | MR 2571608 | Zbl 1211.05002
[11] Grone, R., Merris, R., Sunder, V. S.: The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11 (1990), 218-238. DOI 10.1137/0611016 | MR 1041245 | Zbl 0733.05060