Harmonic Centrality in Some Graph Families
Discrete Mathematics
2022-04-05 v2 Combinatorics
Abstract
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.
Cite
@article{arxiv.2111.12239,
title = {Harmonic Centrality in Some Graph Families},
author = {Jose Mari E. Ortega and Rolito G. Eballe},
journal= {arXiv preprint arXiv:2111.12239},
year = {2022}
}
Comments
13 pages, 5 figures