Bacak-Turan G.Oz E.2024-07-222024-07-22201701290541http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/15314A 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.EnglishArticle10.1142/S0129054117500216