A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS

We characterize graphs with minimal distance spectral radius in two classes of graphs: with vertex connectivity k and minimum degree at least k, and with given number of blocks. Moreover, we determine the unique graph that maximizes the distance spectral radius among all graphs with given clique number.