Maximizing the spectral radius of k-connected graphs with given diameter

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. P. Hansen and D. Stevanović (2008) [9] determined the graphs with maximum spectral radius among all connected graphs of order n with diameter D. In this paper, we generalize this result to k-connected graphs of order n with diameter D.