Browsing by Author "Kirlangic, Alpay"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    Article
    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.