Vulnerability Measures of Transformation Graph G(xy)+


AYTAÇ A., TURACI T.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, cilt.26, ss.667-675, 2015 (SCI İndekslerine Giren Dergi)

  • Cilt numarası: 26 Konu: 6
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1142/s0129054115500379
  • Dergi Adı: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
  • Sayfa Sayısı: ss.667-675

Özet

Several factors have to be taken into account in the design of large interconnection networks. Optimal design is important both to achieve good performance and to reduce the cost of construction and maintenance. Practical communication networks are exposed to failures of network components. Failures between nodes and connections happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. Robustness of the network topology is a key aspect in the design of computer networks. A variety of measures have been proposed in the literature to quantify the robustness of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. In this paper, we study the vulnerability of interconnection networks to the failure of individual nodes, using a graph-theoretic concept of domination and strong-weak domination numbers of the transformation graph G(xy)+ as a measure of network robustness.