Notes on the betweenness centrality of a graph

Year, pages: 2012, 1 - 12

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.

Gago, S., Hurajová, J., Madaras, T. 2012. Notes on the betweenness centrality of a graph. In Mathematica Slovaca, vol. 62, no.1, pp. 1-12. 0139-9918. DOI: https://doi.org/10.2478/s12175-011-0065-7

Gago, S., Hurajová, J., Madaras, T. (2012). Notes on the betweenness centrality of a graph. Mathematica Slovaca, 62(1), 1-12. 0139-9918. DOI: https://doi.org/10.2478/s12175-011-0065-7