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 | 2025-04-10T10:30:58Z | |
| dc.date.available | 2025-04-10T10:30:58Z | |
| 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) - vertical bar S vertical bar - c(G/S) : S subset of 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. | |
| dc.identifier.e-issn | 1687-0042 | |
| dc.identifier.issn | 1110-757X | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/37522 | |
| dc.language.iso | English | |
| dc.title | Graph Operations and Neighbor Rupture Degree | |
| dc.type | Article |