EccentricityCentrality

EccentricityCentrality[g]
gives a list of eccentricity centralities for the vertices in the graph g.

DetailsDetails

  • EccentricityCentrality will give high centralities to vertices that are at short maximum distances to every other reachable vertex.
  • EccentricityCentrality for a graph g is given by , where is the maximum distance from vertex to all other vertices connected to .
  • The eccentricity centrality for isolated vertices is taken to be zero.

ExamplesExamplesopen allclose all

Basic Examples (2)Basic Examples (2)

Compute eccentricity centralities:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=

Highlight:

In[3]:=
Click for copyable input
Out[3]=

Rank vertices. Highest-ranked vertices are at short distances to every other reachable vertex:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=
New in 9
New to Mathematica? Find your learning path »
Have a question? Ask support »