GraphCenter

The vertices of a Graph whose eccentricity equals GraphRadius(g).

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

GraphCenter(g)every vertex with the smallest (finite) eccentricity, in VertexList(g) order.

Typed signatures

Type	Package	Applies
(value) -> list<any>	combinatorics	always

Domain: Collections

Details

• A vertex with an infinite eccentricity (unreachable from some other vertex) is never in the center, even on a disconnected graph where every FINITE eccentricity happens to tie.

Examples

Basic #

live ↗

In$\mathrm{GraphCenter}(\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$\bigl\lbrack3\bigr\rbrack$

About

Examples	1
Checked against	Wolfram Language 1 agree
Crosswalk	Wolfram Language

See also: GraphPeriphery, GraphRadius, VertexEccentricity