Neighbor rupture degree and the relations between other parameters

BACAK TURAN G., KIRLANGIÇ A.

Ars Combinatoria, cilt.102, ss.333-352, 2011 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 102
  • Basım Tarihi: 2011
  • Dergi Adı: Ars Combinatoria
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.333-352
  • Anahtar Kelimeler: Vulnerability, Neighbor Integrity, Rupture Degree, Neighbor Rupture Degree
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

The vulnerability shows the resistance of the network until communication breakdown after the disruption of certain stations or communication links. This study introduces a new vulnerability parameter, neighbor rupture degree. The neighbor rupture degree of a noncomplete connected graph G is denned to be NΙr(G) = max{w(G/S)-|S| - c(G/S) : S ∩ V(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 some classes of graphs are obtained and the relations between neighbor rupture degree and other parameters are determined.