Distance spectral radius of trees with fixed number of pendent vertices

The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). In this paper, we characterize the graph with minimum distance spectral radius among trees with fixed number of pendent vertices.