Compute betweenness centralities:

Highlight:

Rank vertices. Highest-ranked vertices are on many shortest paths of other vertex pairs:

BetweennessCentrality works with undirected graphs:

Directed graphs:

Multigraphs:

Mixed graphs:

Use rules to specify the graph:

BetweennessCentrality works with large graphs:

Rank vertices by the fraction of shortest paths between other vertices:

Highlight the betweenness centrality for CycleGraph:

GridGraph:

CompleteKaryTree:

PathGraph:

Find the members who can easily withhold or distort information in transmission in a network:

Highlight the network:

A power grid network representing the topology of the Western States Power Grid of the United States. Identify critical nodes whose failures will most affect the grid:

The neighborhood of the critical nodes:

Find the toll station that would collect the most money in a toll road network:

For graphs with vertices, the largest sum in differences in betweenness centrality between the most central vertex and all other vertices is :

Measure how central the most central vertex is with respect to other vertices:

Centralization of social networks:

Betweenness centralities for an undirected graph are equivalent to centralities for each component:

Computing the centralities for each component yields the same result:

Betweenness centralities for isolated vertices are taken to be zero:

Use VertexIndex to obtain the centrality of a specific vertex: