Abstract
Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, is a general formula for calculating a graph-level centrality score based on the node-level centrality measure. The latter enables us to compare graphs based on the extent to which the connections of a given network are concentrated on a single vertex or group of vertices. One of the measures of centrality in social network analysis is harmonic centrality. It sums the inverse of the geodesic distances of each node to other nodes where it is 0 if there is no path from one node to another, with the sum normalized by dividing it by $m-1$, where $m$ is the number of nodes of the graph. In this paper, we present some results regarding the harmonic centralization of some important families of graphs with the hope that formulas generated herein will be of use when one determines the harmonic centralization of more complex graphs.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
