Graph Operations and Neighbor Rupture Degree

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

Journal of Applied Mathematics, 2013, vol. 2013, 1-7

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 , say , is a set of vertices in whose closed neighborhood is removed from . The survival subgraph is denoted by . The neighbor rupture degree of , , is defined to be , where is any vertex subversion strategy of , is the number of connected components in and is the maximum order of the components of (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)
http://downloads.hindawi.com/journals/JAM/2013/836395.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/836395.xml (text/xml)

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:hin:jnljam:836395

DOI: 10.1155/2013/836395

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().