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

Examples

open allclose all

Basic Examples  (1)

Give the graph radius for a complete graph:

Scope  (7)

GraphRadius works with undirected graphs:

Directed graphs:

Weighted graphs:

Multigraphs:

Mixed graphs:

Use rules to specify the graph:

GraphRadius works with large graphs:

Applications  (1)

Illustrate the radius in two Petersen graphs:

For a CompleteGraph, the radius is 1:

For a PathGraph of size , the radius is TemplateBox[{{n, /, 2}}, Floor]:

For a CycleGraph of size , the radius is TemplateBox[{{n, /, 2}}, Floor]:

For a WheelGraph, the radius is 1:

For a GridGraph of size {m,n}, the radius is TemplateBox[{{m, /, 2}}, Floor]+TemplateBox[{{n, /, 2}}, Floor]:

For a CompleteKaryTree tree of depth , the radius is :

Properties & Relations  (1)

For a connected graph, the radius can be computed by VertexEccentricity:

Introduced in 2010
 (8.0)
 |
Updated in 2015
 (10.3)