Neighbor Rupture Degree of Transformation Graphs Gxy-

BACAK TURAN G., Oz E.

International Journal of Foundations of Computer Science, cilt.28, sa.4, ss.335-355, 2017 (SCI-Expanded) identifier

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

Özet

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 (Equation presented) 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 study, the neighbor rupture degree of transformation graphs G-, G+-, G-+- and G++- of path graphs, cycle graphs, wheel graphs, complete graphs and complete bipartite graphs are obtained.