Minimum distance signless Laplacian spectral radius of connected graphs with cut vertices

In the class of connected graphs on n vertices with cut vertices, the unique graph with minimum distance signless Laplacian spectral radius was determined by using eigenvector equation to study eigenvalues and a lower bound for the distance signless Laplacian spectral radius in terms of order n was given.