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"].
See alsoCentral Point,
Graph Center,
Graph Diameter,
Graph Eccentricity Explore with Wolfram|Alpha ReferencesHarary, 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. Referenced on Wolfram|AlphaGraph Radius Cite this as:Weisstein, Eric W. "Graph Radius." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GraphRadius.html
Subject classificationsRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4