GraphPeriphery

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

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

GraphPeriphery(g)every vertex with the largest (finite) eccentricity, in VertexList(g) order.

Typed signatures

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

Domain: Collections

Examples

Basic #

live ↗

In$\mathrm{GraphPeriphery}(\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\lbrack1, 5\bigr\rbrack$

About

Examples	1
Checked against	Wolfram Language 1 agree
Crosswalk	Wolfram Language

See also: GraphCenter, GraphDiameter, VertexEccentricity