Graph operations and neighbor rupture degree

Kandilci S., BACAK TURAN G., Polat R.

Journal of Applied Mathematics, cilt.2013, 2013 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 2013
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1155/2013/836395
  • Dergi Adı: Journal of Applied Mathematics
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

In a communication network, the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. A vertex subversion strategy of a graph G, say S, is a set of vertices in G whose closed neighborhood is removed from G. The survival subgraph is denoted by G/S. The neighbor rupture degree of G, Nr(G), is defined to be Nr (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 (G. Bacak Turan, 2010). In this paper we give some results for the neighbor rupture degree of the graphs obtained by some graph operations. © 2013 Saadet Kandİlcİ et al.