On graphs with distance Laplacian eigenvalues of multiplicity $n-4$

Saleem Khan, S. Pirzada

Let $G$ be a connected simple graph with $n$ vertices. The distance Laplacian matrix $D^L(G)$ is defined as $D^L(G)=Diag(Tr)-D(G)$, where $Diag(Tr)$ is the diagonal matrix of ver…