The distance signless Laplacian spectral radius of trees with n-3 pendent vertices

The distance signless Laplacian spectral radius of a connected graph G is the spectral radius of the distance signless Laplacian matrix of G, defined as Q(G)=Tr(G)+D(G), where Tr(G) is the diagonal matrix of vertex transmissions of G, and D(G) is the distance matrix of G. It was investigated that the minimum of the distance signless Laplacian spectral radius among all trees with n-3 pendent vertices, and characterized that the unique tree whose distance signless Laplacian spectral radius is the maximum (minimum) among some trees with n-3 pendent vertices.