Graphs that are cospectral for the distance Laplacian

Boris Brimkov, Ken Duna, Leslie Hogben +4

The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\m…