GraphRadius[g]
gives the minimum eccentricity of the vertices in the graph g.
GraphRadius[{vw,…}]
uses rules vw to specify the graph g.
GraphRadius
GraphRadius[g]
gives the minimum eccentricity of the vertices in the graph g.
GraphRadius[{vw,…}]
uses rules vw to specify the graph g.
Details and Options
- The following options can be given:
-
EdgeWeight Automatic weight for each edge Method Automatic method to use - Possible Method settings include "Dijkstra", "FloydWarshall", and "Johnson".
Examples
open all close allBasic Examples (1)
Scope (7)
GraphRadius works with undirected graphs:
GraphRadius[[image]]GraphRadius[[image]]GraphRadius[[image]]GraphRadius[[image]]GraphRadius[[image]]Use rules to specify the graph:
GraphRadius[{1 -> 2, 2 -> 3, 3 -> 1, 3 -> 4, 4 -> 5, 5 -> 3}]GraphRadius works with large graphs:
g = GridGraph[{10, 10, 10, 10}];GraphRadius[g]//TimingApplications (1)
Illustrate the radius in two Petersen graphs:
findRadiusPath[g_ ? UndirectedGraphQ] := Module[{c = First@GraphCenter[g], d, v, pos}, d = Table[GraphDistance[g, c, u], {u, VertexList[g]}];
pos = First@Position[d, Max[d]];
v = First@Part[VertexList[g], pos];
PathGraph@FindShortestPath[g, c, v]]HighlightGraph[#, findRadiusPath[#]]& /@ {PetersenGraph[5, 2], PetersenGraph[6, 2]}For a CompleteGraph, the radius is 1:
HighlightGraph[#, findRadiusPath[#]]& /@ Table[CompleteGraph[n, VertexSize -> Small], {n, 3, 6}]For a PathGraph of size
, the radius is
:
HighlightGraph[#, findRadiusPath[#]]& /@ Table[PathGraph[Range[n], VertexSize -> Small], {n, 5, 8}]For a CycleGraph of size
, the radius is
:
HighlightGraph[#, findRadiusPath[#]]& /@ Table[CycleGraph[n, VertexSize -> Small], {n, 3, 6}]For a WheelGraph, the radius is 1:
HighlightGraph[#, findRadiusPath[#]]& /@ Table[WheelGraph[n, VertexSize -> Small], {n, 5, 8}]For a GridGraph of size {m,n}, the radius is
:
HighlightGraph[#, findRadiusPath[#]]& /@ Table[GridGraph[dim, VertexSize -> Small, ImageSize -> {Tiny, Tiny}], {dim, {{3, 3}, {3, 4}, {4, 3}, {4, 4}}}]For a CompleteKaryTree tree of depth
, the radius is
:
HighlightGraph[#, findRadiusPath[#]]& /@ Table[CompleteKaryTree[n, VertexSize -> Small], {n, 3, 5}]Properties & Relations (1)
For a connected graph, the radius can be computed by VertexEccentricity:
g = GridGraph[{3, 4}]GraphRadius[g]Min[VertexEccentricity[g, #]& /@ VertexList[g]]Related Guides
Text
Wolfram Research (2010), GraphRadius, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphRadius.html (updated 2015).
CMS
Wolfram Language. 2010. "GraphRadius." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/GraphRadius.html.
APA
Wolfram Language. (2010). GraphRadius. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/GraphRadius.html
BibTeX
@misc{reference.wolfram_2026_graphradius, author="Wolfram Research", title="{GraphRadius}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/GraphRadius.html}", note=[Accessed: 13-June-2026]}
BibLaTeX
@online{reference.wolfram_2026_graphradius, organization={Wolfram Research}, title={GraphRadius}, year={2015}, url={https://reference.wolfram.com/language/ref/GraphRadius.html}, note=[Accessed: 13-June-2026]}