Betweenness Centrality of Cartesian Product of Graphs
Combinatorics
2016-03-15 v1
Abstract
Betweenness centrality is a widely-used measure in the analysis of large complex networks. It measures the potential or power of a vertex to control the communication over the network under the assumption that information primarily flows over the shortest paths between them. In this paper we prove several results on betweenness centrality of Cartesian product of graphs.
Keywords
Cite
@article{arxiv.1603.04258,
title = {Betweenness Centrality of Cartesian Product of Graphs},
author = {Sunil Kumar R and Kannan Balakrishnan},
journal= {arXiv preprint arXiv:1603.04258},
year = {2016}
}