More results on the distance (signless) Laplacian eigenvalues of graphs

Jie Xue, Huiqiu Lin, Kinkar Ch. Das +1

Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. Let $Tr(G)$ be the diagonal matrix of vertex transmissions of $G$ and $D(G)$ be the distance matrix of $G$.…