Residual closeness in networks

被引：164

作者：

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 [J].