Browsing by Author "Oz E."

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    Neighbor Rupture Degree of Transformation Graphs Gxy-
    (World Scientific Publishing Co. Pte Ltd, 2017) Bacak-Turan G.; Oz E.
    A vulnerability parameter the neighbor rupture degree can be used to obtain the vulnerability of a spy network. The neighbor rupture degree of a noncomplete connected graph G is defined to be (Equation presented) 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 study, the neighbor rupture degree of transformation graphs G-, G+-, G-+- and G++- of path graphs, cycle graphs, wheel graphs, complete graphs and complete bipartite graphs are obtained. © 2017 World Scientific Publishing Company.