Neighbor Rupture Degree of Harary Graphs

Altundag F. N., BACAK TURAN G.

International Journal of Foundations of Computer Science, cilt.27, sa.6, ss.739-756, 2016 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 27 Sayı: 6
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1142/s012905411650026x
  • Dergi Adı: International Journal of Foundations of Computer Science
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.739-756
  • Anahtar Kelimeler: Harary graphs, neighbor rupture degree, Vulnerability
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

The vulnerability shows the endurance of the network until the communication collapse after the breakdown of certain stations or communication links. If a spy or a station is invaded in a spy network, then the adjacent stations are treacherous. A vulnerability parameter the neighbor rupture degree can be used to obtain the vulnerability of a spy network. The neighbor rupture degree of a noncomplete connected graph G is defined to be Nr(G) = max{w(G/S) - |S| - c(G/S): S SV (G),w(G/S) ≥ 1} where S is any vertex subversion strategy of G, w(G/S) is the number of connected components in G/S, and c(G/S) is the maximum order of the components of G/S. In this paper, the neighbor rupture degree of Harary graphs are obtained.