On the multiplicity of the least signless Laplacian eigenvalue of a graph (Q2144486)

Given an \(n\)-vertex connected simple graph \(G,\) let \(A(G),\, D(G)\) be the adjacency matrix and degree diagonal matrix of \(G\), respectively. Then \(Q(G)=D(G)+A(G)\) is the well-known signless Laplacian matrix of \(G\). The eigenvalues of \(Q(G)\) are called the \(Q\)-eigenvalues of \(G\). In this paper, the authors study the multiplicity of the smallest \(Q\)-eigenvalues of \(G\) and identify all the \(n\)-vertex connected graphs with the smallest \(Q\)-eigenvalues of multiplicity \(n-3\). Furthermore, they show that all these graphs are determined by their signless Laplacian spectra. It is a nice paper.