GraphRadius

The smallest eccentricity among all vertices of a Graph.

✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram LanguageGraphRadius✓↗

GraphRadius(g)min over v of VertexEccentricity(g, v); PositiveInfinity if g is disconnected.

Typed signatures

Type	Package	Applies
(value) -> real | signed_infinity	combinatorics	always

Domain: Collections

Details

• radius <= diameter <= 2 * radius always holds for a connected graph.

Examples

Basic #

live ↗

In$\mathrm{GraphRadius}(\mathrm{Graph}(\bigl\lbrack1, 2, 3, 4, 5\bigr\rbrack, \bigl\lbrack\mathrm{UndirectedEdge}(1, 2), \mathrm{UndirectedEdge}(2, 3), \mathrm{UndirectedEdge}(3, 4), \mathrm{UndirectedEdge}(4, 5)\bigr\rbrack))$Out$2$

About

Examples	1
Checked against	Wolfram Language 1 agree
Crosswalk	Wolfram Language

See also: GraphDiameter, GraphCenter, VertexEccentricity