On the spread of the distance signless Laplacian matrix of a graph
On the spread of the distance signless Laplacian matrix of a graph
Abstract Let G be a connected graph with n vertices, m edges. The distance signless Laplacian matrix D Q (G) is defined as D Q (G) = Diag(Tr(G)) + D(G), where Diag(Tr(G)) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix of G. The distance signless …