  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.
