Graphs with some distance Laplacian eigenvalue of multiplicity n − 3

The eigenvalues of the distance Laplacian matrix of a connected graph G are called the distance Laplacian eigenvalues of G. Denote by G(n,n−3) the set of all connected graphs on n vertices with some distance Laplacian eigenvalue of multiplicity n−3. In this paper, all graphs belonging to G(n,n−3) are characterized completely, which solves the remaining problems in Fernandes et al. (2018) [11].