Betweenness Centrality of Cartesian Product of Graphs

TL;DR

This paper investigates the betweenness centrality of Cartesian product graphs, providing new theoretical results that enhance understanding of how this measure behaves in complex network structures.

Contribution

It presents novel theoretical results on betweenness centrality specifically for Cartesian product graphs, expanding the analytical tools available for network analysis.

Findings

Derived new formulas for betweenness centrality in Cartesian product graphs

Provided bounds and properties related to centrality measures in product graphs

Enhanced understanding of control potential of nodes in complex networks

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.