gives a list of status centralities for the vertices in the graph g.
uses rules vw to specify the graph g.
Details 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.
Examplesopen allclose all
Basic Examples (2)
By default, StatusCentrality finds centralities using machine-precision computations:
Properties & Relations (2)
Use VertexIndex to obtain the centrality of a specific vertex: