On distance spectral radius of graphs

We determine the unique tree of given domination number with minimum distance spectral radius and the unique connected graph (tree) of given domination number with maximum distance spectral radius. We also determine the unique tree of given bipartition size with minimum distance spectral radius and the unique connected bipartite graph (tree) of given bipartition size with maximum distance spectral radius. Finally, we determine the unique trees with the second and the third minimum (maximum, respectively) distance spectral radii among the trees on n⩾6 vertices.