On graphs with distance Laplacian eigenvalues of multiplicity <i>n</i>โ4
On graphs with distance Laplacian eigenvalues of multiplicity <i>n</i>โ4
Let G be a connected simple graph with n vertices. The distance Laplacian matrix DL(G) is defined as DL(G)=Diag(Tr)โD(G), where Diag(Tr) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix of G. The eigenvalues of DL(G) are the distance Laplacian eigenvalues of G and are denoted โฆ