VertexEccentricity

The greatest distance from a vertex to any other vertex of a Graph.

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

VertexEccentricity(g)the eccentricity of every vertex, in VertexList(g) order.

VertexEccentricity(g, v)just v's eccentricity.

Typed signatures

Type	Package	Applies
(value, any?) -> list<real | signed_infinity> | real | signed_infinity	combinatorics	always

Domain: Collections

Details

• The moment any OTHER vertex is unreachable from v, the eccentricity is PositiveInfinity -- not just the max over whatever happens to be reachable.
• Distances respect edge direction, same as GraphDistance.

Examples

Basic #

live ↗

In$\mathrm{VertexEccentricity}(\mathrm{PetersenGraph}(), 1)$Out$2$

live ↗

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

About

Examples	2
Checked against	Wolfram Language 1 agree1 differ
Crosswalk	Wolfram Language

See also: GraphRadius, GraphDiameter, GraphCenter