Analysis of the Bound of Katz-Bonacic Centrality for Rooted Random Graphs

Abstract Centrality measures play an important role in network graph theory. They are widely used in social network analysis as tools to provide a measure of the importance of certain nodes. In this paper, we look at a specific measure, namely, the walk statistic and provide theoretical results on their values on rooted random trees, rooted random wheels and rooted fans.