RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS


AYTAÇ A. , Odabas Z. N.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, vol.22, no.5, pp.1229-1240, 2011 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 22 Issue: 5
  • Publication Date: 2011
  • Doi Number: 10.1142/s0129054111008660
  • Title of Journal : INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
  • Page Numbers: pp.1229-1240

Abstract

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.