Browsing by Author "Bacak-Turan, Goksen"

Now showing 1 - 2 of 2

Citation - WoS: 3
Citation - Scopus: 3
Graph Operations and Neighbor Rupture Degree
(HINDAWI LTD, 2013) Saadet Kandilci; Goksen Bacak-Turan; Refet Polat; Bacak-Turan, Goksen; Kandilci, Saadet; Polat, Refet
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.
Citation - WoS: 13
Citation - Scopus: 14
Neighbor rupture degree and the relations between other parameters
(Charles Babbage Research Centre, 2011) Goksen Bacak-Turan; Alpay Kirlangiç; Bacak-Turan, Goksen; Kirlangic, Alpay
The vulnerability shows the resistance of the network until communication breakdown after the disruption of certain stations or communication links. This study introduces a new vulnerability parameter neighbor rupture degree. The neighbor rupture degree of a noncomplete connected graph G is denned to be NΙr(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. In this paper the neighbor rupture degree of some classes of graphs are obtained and the relations between neighbor rupture degree and other parameters are determined. © 2023 Elsevier B.V. All rights reserved.