compute betweenness centrality
(optional) a vertex of G
BetweennessCentrality returns the betweenness centrality for a specified vertex in the given graph G, or if no vertex is specified, returns a list of the betweenness centralities for each vertex in G.
The betweenness centrality of a vertex v is a measure of the proportion of shortest paths through the graph which pass through v. It is the sum over all pairs of vertices a and b (both different from v) of the number of least-weight paths from a to b which pass through v divided by the total number of least-weight paths from a to b.
Compute the betweenness centrality for a specified graph.
G ≔ Graph⁡6,1,3,1,6,2,6,2,4,3,6,4,6,4,5,5,6
G≔Graph 1: an undirected graph with 6 vertices and 8 edge(s)
The GraphTheory[BetweennessCentrality] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document
What kind of issue would you like to report? (Optional)