The radius of a graph is the minimum graph eccentricity of any graph vertex in a graph.
A disconnected graph therefore has infinite radius (West 2000, p. 71).
Graph radius is implemented in the Wolfram Language as GraphRadius[g].
Precomputed radii for many named graphs can be obtained using GraphData[graph,
"Radius"].