On the distance spectral radius of some graphs

Abstract

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, we determine the unique graph with minimum distance spectral radius among all connected graphs of order n with a given diameter. Moreover, we determine the unique graph with maximum distance spectral radius among the catacondensed hexagonal systems with h hexagons.