Wolfram Language & System 11.0 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.
BUILT-IN WOLFRAM LANGUAGE SYMBOL

StatusCentrality

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

StatusCentrality[{vw,}]
uses rules vw to specify the graph g.

Details and OptionsDetails and Options

• StatusCentrality gives a list of centralities that satisfy , where is the adjacency matrix of g, is the vector of minimums between the inverse of the largest in- or out-degree of each vertex, and is the vertex in-degree of g.
• The status centrality for an isolated vertex is taken to be zero.
• StatusCentrality works with undirected graphs, directed graphs, multigraphs, and mixed graphs.

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

Compute status centralities:

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

Highlight:

 In[3]:=
 Out[3]=

Rank vertices. Highest-ranked vertices are connected from other well-connected vertices:

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