# Is the spectral radius of a graph related to its radius?

I am looking for algorithms to estimate the radius of a graph and I discovered that there are documents on the spectral radius of a graph. As far as I know, the radius of a graph is $$max_ {v in V} ecc (v)$$ or $$ecc (v)$$ is the depth of a rooted tree to $$v$$, and the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Are these two concepts related in a certain way?