GraphDiameter

The greatest eccentricity among all vertices of a Graph.

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

GraphDiameter(g)max over v of VertexEccentricity(g, v); PositiveInfinity if g is disconnected.

Typed signatures

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

Domain: Collections

Examples

Basic #

live ↗

In$\mathrm{GraphDiameter}(\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$4$

live ↗

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

About

Examples	2
Checked against	Wolfram Language 2 agree
Crosswalk	Wolfram Language

See also: GraphRadius, GraphPeriphery, VertexEccentricity