Neighbor Rupture Degree of Transformation Graphs Gxy-
| dc.contributor.author | Bacak-Turan G. | |
| dc.contributor.author | Oz E. | |
| dc.date.accessioned | 2024-07-22T08:10:37Z | |
| dc.date.available | 2024-07-22T08:10:37Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | 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. | |
| dc.identifier.DOI-ID | 10.1142/S0129054117500216 | |
| dc.identifier.issn | 01290541 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/15314 | |
| dc.language.iso | English | |
| dc.publisher | World Scientific Publishing Co. Pte Ltd | |
| dc.title | Neighbor Rupture Degree of Transformation Graphs Gxy- | |
| dc.type | Article |