Betweenness centrality

In calculating betweenness and closeness centralities of all vertices in a graph, it is assumed that graphs are undirected and connected with the allowance of loops and multiple edges. When specifically dealing with network graphs, often graphs are without loops or multiple edges to maintain simple relationships (where edges represent connections ...
Found on http://en.wikipedia.org/wiki/Betweenness_centrality
No exact match found