This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.

# VertexEccentricity

 VertexEccentricity gives the length of the longest shortest path from the source s to every other vertex in the graph g.
• VertexEccentricity gives the vertex eccentricity for the connected component in which s is contained.
Find the vertex eccentricity of vertex 1 in a graph:
Find the vertex eccentricity of vertex 1 in a graph:
 Out[1]=
 Out[2]=
 Scope   (3)
VertexEccentricity works with undirected graphs:
Directed graphs:
Large graphs:
 Applications   (6)
In an PetersenGraph, every vertex has the same eccentricity:
Some Petersen graphs have different eccentricities for the inner and outer subgraphs:
Compute and highlight the vertex eccentricity for special graphs, including GridGraph:
Package this up as a function:
Many special graphs have constant vertex eccentricity:
A few will have varying eccentricity, where some vertices are more centrally located:
Most random graphs have small eccentricities:
The Gilbert random graph:
The Barabasi-Albert random graph:
The de Solla Price random graph:
People at a family gathering:
Use Subsets to create edges between all members of a family:
The resulting social graph:
Low eccentricity indicates close relation to everybody at the gathering. Compare Larry and Rudy:
Build a network of related concepts based on the "See Also" section of reference pages: