Goksen Bacak-TuranAlpay KirlangiçBacak-Turan, GoksenKirlangic, Alpay2025-10-06201128175204, 038170320381-70322-s2.0-80053952726https://www.scopus.com/inward/record.uri?eid=2-s2.0-80053952726&partnerID=40&md5=83552fa8532dd3ec0e3a15a34b2b853bhttps://gcris.yasar.edu.tr/handle/123456789/10253The 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.Englishinfo:eu-repo/semantics/closedAccessNeighbor Integrity, Neighbor Rupture Degree, Rupture Degree, VulnerabilityRupture DegreeNeighbor Rupture DegreeNeighbor IntegrityVulnerabilityArticle