On graphs with m(partial^L₁)=n-3

Let $\partial^L_1\ge\partial^L_2\ge\cdots\ge\partial^L_n$ be the distance Laplacian eigenvalues of a connected graph $G$ and $m(\partial^L_i)$ the multiplicity of $\partial^L_i$. It is well known that the graphs with $m(\partial^L_1)=n-1$ are complete graphs. Recently, the graphs with $m(\partial^L_1)=n-2$ have been characterized by Celso et al. In this paper, we completely determine the graphs with $m(\partial^L_1)=n-3$.