Radius returns the minimum eccentricity over all vertices in the graph G.

If G is disconnected, then Radius returns infinity.

For weighted graphs the edge weights are used to denote the distance accrued while traveling along each edge.  For unweighted graphs the length of each edge is assumed to be 1.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$P≔\mathrm{PetersenGraph}\left(\right)$

$P≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 10\; vertices\; and\; 15\; edge(s)}$

$\mathrm{Radius}\left(P\right)$

$2$

$C≔\mathrm{CycleGraph}\left(19\right)$

$C≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 19\; vertices\; and\; 19\; edge(s)}$

$\mathrm{Radius}\left(C\right)$

$9$

$G≔\mathrm{Graph}\left(\left\{\left[\left\{1\,2\right\}\,0.2\right]\,\left[\left\{1\,4\right\}\,1.1\right]\,\left[\left\{2\,3\right\}\,0.3\right]\,\left[\left\{3\,4\right\}\,0.4\right]\right\}\right)$

$G≔\mathrm{Graph\; 3:\; an\; undirected\; weighted\; graph\; with\; 4\; vertices\; and\; 4\; edge(s)}$

$\mathrm{DrawGraph}\left(G\right)$

$\mathrm{Radius}\left(G\right)$

$0.5$

$\mathrm{DijkstrasAlgorithm}\left(G\,1\,4\right)$

$\left[\left[1\,2\,3\,4\right]\,0.9\right]$

The GraphTheory[Radius] command was introduced in Maple 2017.

For more information on Maple 2017 changes, see Updates in Maple 2017.