Graphs of order $n$ and diameter $2(n-1)/3$ minimizing the spectral radius

Jingfen Lan, Lingsheng Shi

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ ver…