In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths.

What is meant by betweenness centrality?

It is basically defined as the number of shortest paths in the graph that pass through the node divided by the total number of shortest paths. Betweenness centrality measures how often a node occurs on all shortest paths between two nodes.

What is a betweenness centrality used for?

Betweenness centrality is a way of detecting the amount of influence a node has over the flow of information in a graph. It is often used to find nodes that serve as a bridge from one part of a graph to another.