论文信息 - SOME CENTRALITY RESULTS NEW AND OLD

SOME CENTRALITY RESULTS NEW AND OLD

We prove a number of results on betweenness and closeness centrality and centralization. In particular, we prove the much used normalization expression for closeness centrality first given by Freeman (1979), correcting an error in the justification given in his paper. We explore the relationship between betweenness and the cutting number and use these results to prove and correct some centrality and centralization formulae first proposed by Borgatti and Everett (1997).

[1] Frank Harary,et al. The cutting center theorem for trees , 1971, Discret. Math..

[2] L. Freeman. Centrality in social networks conceptual clarification , 1978 .

[3] Gert Sabidussi,et al. The centrality index of a graph , 1966 .

[4] Burleigh B. Gardner,et al. Deep South: A Social Anthropological Study of Caste and Class , 1942 .

[5] Martin G. Everett,et al. The hull number of a graph , 1985, Discret. Math..

[6] Martin G. Everett,et al. Network analysis of 2-mode data , 1997 .