A graph transformation was introduced to show the effect of the distance spectral radius.Further,the set of trees with given number of vertices of degree 4 was studied,characterizing the extremal graph with the largest distance spectral radius.Finally,the more general class of graphs,namely,the set of trees with given number of vertices of degree at least 4 was discussed,and also its extremal graph was characterized.