Residual closeness in networks

被引：158

作者：

Dangalchev, Chavdar

机构：

[1] Bellevue, WA 98006, 5710 122nd Avenue SE

来源：

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS | 2006年 / 365卷 / 02期

关键词：

graph vulnerability; closeness; connectivity; toughness; vertex integrity;

D O I：

10.1016/j.physa.2005.12.020

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

A new characteristic (residual closeness) which can measure the network resistance is presented. It evaluates closeness after removal of vertices or links, hence two types are considered-vertices and links residual closeness. This characteristic is more sensitive than the well-known measures of vulnerability-it captures the result of actions even if they are small enough not to disconnect the graph. A definition for closeness is modified so it still can be used for unconnected graphs but the calculations are easier. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：556 / 564

页数：9

共 12 条

[1] Emergence of scaling in random networks
Barabási, AL
Albert, R
[J]. SCIENCE, 1999, 286 (5439) : 509 - 512
[2] Barefoot C., 1987, J Comb Math Comb Comput, V1, P12
[3] Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6
[4] Generation models for scale-free networks
Dangalchev, C
[J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2004, 338 (3-4) : 659 - 671
[5] Evolution of networks with aging of sites
Dorogovtsev, SN
Mendes, JFF
[J]. PHYSICAL REVIEW E, 2000, 62 (02): : 1842 - 1845
[6] ERDOS P, 1960, B INT STATIST INST, V38, P343
[7] CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION
FREEMAN, LC
[J]. SOCIAL NETWORKS, 1979, 1 (03) : 215 - 239
[8] CLASS OF POSETS AND CORRESPONDING COMPARABILITY GRAPHS
JUNG, HA
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (02) : 125 - 133
[9] Efficient behavior of small-world networks
Latora, V
Marchiori, M
[J]. PHYSICAL REVIEW LETTERS, 2001, 87 (19) : 198701 - 1
[10] NEWMAN MEJ, 2004, ARXIVCONDMAT0309045

← 1 2 →