Graph Radius

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"].

REFERENCES

Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.

Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 107, 1990.

West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2000.