Betweenness centrality profiles in trees


Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The kbetweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most k. The sequence of k-betweenness centralities for all… (More)
DOI: 10.1093/comnet/cnx007


8 Figures and Tables

Cite this paper

@article{Fish2017BetweennessCP, title={Betweenness centrality profiles in trees}, author={Benjamin Fish and Rahul Kushwaha and Gy{\"o}rgy Tur{\'a}n}, journal={J. Complex Networks}, year={2017}, volume={5}, pages={776-794} }