One of the more recent measures of centrality in social network analysis is the normalized harmonic centrality. A variant of the closeness centrality, harmonic centrality 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. It is then normalized by dividing it by m-1, where m is the number of nodes of the graph. In this paper, we present notions regarding the harmonic centrality of some important classes of graphs.

翻译：在社会网络分析中,最近衡量中心地位的一项措施是标准化的和谐中心地位。近距离中心地位、协调中心地位的一个变体是每个节点与其他节点之间的大地距离的反比,如果没有从一个节点到另一个节点的路径,则每个节点与其他节点之间的大地距离为0。然后,通过将其除以 m-1,即图中节点的数量,将其除以 m-1 来使其正常化。在本文中,我们提出了一些关于一些重要类图的和谐中心地位的概念。