Graph operations and neighbor rupture degree
| dc.contributor.author | Kandilci S. | |
| dc.contributor.author | Bacak-Turan G. | |
| dc.contributor.author | Polat R. | |
| dc.date.accessioned | 2024-07-22T08:18:07Z | |
| dc.date.available | 2024-07-22T08:18:07Z | |
| dc.date.issued | 2013 | |
| dc.description.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. © 2013 Saadet Kandİlcİ et al. | |
| dc.identifier.DOI-ID | 10.1155/2013/836395 | |
| dc.identifier.issn | 16870042 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/17203 | |
| dc.language.iso | English | |
| dc.rights | All Open Access; Gold Open Access | |
| dc.title | Graph operations and neighbor rupture degree | |
| dc.type | Article |