(
graph theory):
The smallest eccentricity in a graph. In other words, after finding the vertex (not necessarily unique) which is the closest to every other vertex (i.e. the maximum path length from it to any other vertex is minimised), then the aformentioned maximum path length is the radius.