Graph Operations and Neighbor Rupture Degree

Saadet Kandİlcİ, Goksen Bacak-Turan and Refet Polat

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/836395

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:836395

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().