On spectral radius of the distance matrix
On spectral radius of the distance matrix
We characterize graphs with minimal spectral radius of the distance matrix in three classes of simple connected graphs with n vertices: with fixed vertex connectivity, matching number and chromatic number, respectively.