Notes on the betweenness centrality of a graph

By Silvia Gago, Jana Coronicová Hurajová, Tomás Madaras. 2012

47 citations recorded by the source corpus.

The betweenness centrality of a vertex of a graph is the portion of the shortest paths between all pairs of vertices passing through a given vertex. We study upper bounds for this invariant and its relations to the diameter and average distance of a graph.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/d4d4295dcc8b9a28f2949f4e81d273b2c94decbe