gives a list of radiality centralities for the vertices in the graph g.

gives a list of in-centralities for a directed graph g.

gives a list of out-centralities for a directed graph g.

uses rules vw to specify the graph g.

# Details

• Radiality in-centralities are also known as integration centralities.
• RadialityCentrality will give high centralities to vertices that are a short distance to every other vertex in its reachable neighborhood compared to its diameter.
• Radiality out-centrality for a vertex is computed using the out component for the vertex and is given by , where is the distance from to in , is the diameter of , and the sum is over the vertices in .
• Radiality in-centrality for a vertex is computed using the in component for the vertex and is given by , where is the distance from to in , is the diameter of , and the sum is over the vertices in .
• The radiality centrality for an isolated vertex is taken to be zero.
• RadialityCentrality works with undirected graphs, directed graphs, weighted graphs, multigraphs, and mixed graphs.

# Examples

open allclose all

## Basic Examples(2)

 In[1]:=
 In[2]:=
 Out[2]=

Highlight:

 In[3]:=
 Out[3]=

Rank vertices. Highest-ranked vertices are at a short distance to all reachable vertices compared to the highest distance in the graph:

 In[1]:=
 In[2]:=
 Out[2]=