Centrality measure in graphs

被引：48

作者：

Klein, D. J. ^{[1
]}

机构：

[1] Texas A&M Univ, Galveston, TX 77553 USA

来源：

JOURNAL OF MATHEMATICAL CHEMISTRY | 2010年 / 47卷 / 04期

关键词：

Centrality; Betweenness; Shortest-path centrality; Resistance-distance centrality; Graph metrics; Neighborliness centrality; OPTIMUM LOCATIONS; ALGORITHM; NETWORKS; MODEL;

D O I：

10.1007/s10910-009-9635-0

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

Centrality of an edge of a graph is proposed to be viewed as a degree of global sensitivity of a graph distance function (i.e., a graph metric) on the weight of the considered edge. For different choices of distance function, contact is made with several previous ideas of centrality, whence their different characteristics are clarified, and strengths or short-comings are indicated, via selected examples. The centrality based on "resistance distance" exhibits several nice features, and might be termed "amongness" centrality.

引用

页码：1209 / 1223

页数：15

共 69 条

[1]

[Anonymous], P 41 HAW INT C SYST

[2] Resistance-distance matrix: A computational algorithm and its application [J].