Cioaba, Sebastian; van Dam, Edwin; Koolen, Jack; Lee, Jae-Ho - 2008
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and the diameter of the graph. For the specific case of graphs with diameter three we give a slightly better bound. We also construct families of graphs with small spectral radius, thus obtaining...