Distance and distance signless Laplacian spread of connected graphs

Lihua You, Liyong Ren, Guanglong Yu

For a connected graph $G$ on $n$ vertices, recall that the distance signless Laplacian matrix of $G$ is defined to be $\mathcal{Q}(G)=Tr(G)+\mathcal{D}(G)$, where $\mathcal{D}(G)$…