Harmonic Centrality and Centralization of Some Graph Products

Harmonic centrality calculates the importance of a node in a network by adding the inverse of the geodesic distances of this node to all the other nodes. Harmonic centralization, on the other hand, is the graph-level centrality score based on the node-level harmonic centrality. In this paper, we present some results on both the harmonic centrality and harmonic centralization of graphs resulting from some graph products such as Cartesian and direct products of the path $P_2$ with any of the path $P_m$, cycle $C_m$, and fan $F_m$ graphs.