Ersin ASLAN2024-07-242024-07-2420172146-4987http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/21915In a network (communication, computer, transportation), the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. The neighbor toughness of a graph G is defined as ( ) ( / ) NT G min : ( / ) G S S G S $ 1 ~ = ( ~ 2, where S is any vertex subversion strategy of G and ω(G/S) is the number of connected components in the graph G/S. In this paper, the relations between neighbor toughness and other parameters are determined. Next, the neighbor toughness of wheels and some related networks namely gear, helm, sunflower and friendshipgraph are calculated.engAraştırma Makalesi10.7212/zkufbd.v1i1.561