共 50 条
RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
被引:32
|作者:
Aytac, Aysun
[1
]
Odabas, Zeynep Nihan
[2
]
机构:
[1] Ege Univ, Dept Math, TR-35100 Izmir, Turkey
[2] Izmir Univ Econ, Fac Engn & Comp Sci, TR-35330 Izmir, Turkey
关键词:
Graph vulnerability;
connectivity;
closeness;
gear graph;
friendship graph;
D O I:
10.1142/S0129054111008660
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
The vulnerability of a network measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, several vulnerability measures have been used to describe the stability of networks, including connectivity, toughness, scattering number, binding number and integrity. We consider a new characteristic, residual closeness which is more sensitive than the well-known vulnerability measures. Residual closeness measures the network resistance evaluating closeness after removal of vertices or links. In this paper, closeness, vertex residual closeness (VRC) and normalized vertex residual closeness (NVRC) of wheels and some related networks namely gear and friendship graph are calculated, and exact values are obtained.
引用
收藏
页码:1229 / 1240
页数:12
相关论文