Extremal values for the spectral radius of the normalized distance Laplacian

Jacob Johnston, Michael Tait

The normalized distance Laplacian of a graph $G$ is defined as ${\mathcal{D}}^{\mathcal{L}}(G)=T(G{)}^{-1/2}(T(G)-\mathcal{D}(G))T(G{)}^{-1/2}$ where $\mathcal{D}(G)$ is the matrix with pa…