gives the length of the longest shortest path from the source s to every other vertex in the graph g.
uses rules vw to specify the graph g.
Examplesopen allclose all
In an PetersenGraph, every vertex has the same eccentricity:
Compute and highlight the vertex eccentricity for special graphs, including GridGraph:
These are the "See Also" entries for Graph:
Use VertexEccentricity to compare the importance of concepts—the lower, the more important:
Properties & Relations (3)
In a connected graph, the vertex eccentricity is related to GraphDistance:
The vertex eccentricity in a connected graph is related to GraphDiameter:
For a CompleteGraph, every vertex has eccentricity 1:
The eccentricity path in a PathGraph switches halfway through:
In a WheelGraph of size 5 or more, the eccentricity is 1 at the hub and 2 elsewhere:
In a GridGraph, the eccentricity path always ends in a corner of the grid:
In a CompleteKaryTree, the eccentricity path always ends in a leaf: