Abstract
The vulnerability shows the endurance of the network until the communication collapse after the breakdown of certain stations or communication links. If a spy or a station is invaded in a spy network, then the adjacent stations are treacherous. 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 [Formula: see text] 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 Harary graphs are obtained.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
