RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS

AYTAÇ A., Odabas Z. N.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, cilt.22, sa.5, ss.1229-1240, 2011 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 22 Sayı: 5
  • Basım Tarihi: 2011
  • Doi Numarası: 10.1142/s0129054111008660
  • Dergi Adı: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1229-1240
  • Anahtar Kelimeler: Graph vulnerability, connectivity, closeness, gear graph, friendship graph
  • Dokuz Eylül Üniversitesi Adresli: Hayır

Özet

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.