  In this paper, we study how the distance spectral radius behaves when the
graph is perturbed by grafting edges. As applications, we also determine the
graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal
distance spectral radius.
