Residual Closeness in Cycles and Related Networks

Odabas Z. N., AYTAÇ A.

FUNDAMENTA INFORMATICAE, cilt.124, sa.3, ss.297-307, 2013 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 124 Sayı: 3
  • Basım Tarihi: 2013
  • Doi Numarası: 10.3233/fi-2013-835
  • Dergi Adı: FUNDAMENTA INFORMATICAE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.297-307
  • Anahtar Kelimeler: Graph vulnerability, Closeness, Network design and communication, Stability, Communication network, Cycles, GRAPHS, POLYNOMIALS, DIAMETER
  • Dokuz Eylül Üniversitesi Adresli: Hayır

Özet

Networks are known to be prone to node or link failures. A central issue in the analysis of networks is the assessment of their stability and reliability. The main aim is to understand, predict, and possibly even control the behavior of a networked system under attacks or disfunctions of any type. A central concept that is used to assess stability and robustness of the performance of a network under failures is that of vulnerability. A network is usually represented by an undirected simple graph where vertices represent processors and edges represent links between processors. Different approaches to properly define a measure for graph vulnerability has been proposed so far. In this paper, we study the vulnerability of cycles and related graphs to the failure of individual vertices, using a measure called residual closeness which provides a more sensitive characterization of the graph than some other well-known vulnerability measures.