On neighbor vulnerability measures for network security

Network security is an important issue in the computing. Vulnerability is called the resistance of the devices or connections in a network until their communication is over in case of damage. To be able to measure the vulnerability, the network must be modeled with graphs so that the devices are expressed with vertices and connections with edges. In this thesis, the neighbor isolated tenacity and neighbor isolated rupture degree from neighbor vulnerability measurement parameters, which are commonly used in spy networks, are discussed. These vulnerability measurement parameters were examined for unwieghted graphs that each vertex is considered equal, and for weighted graphs that weight value is given according to the importance of each vertex. In addition, we gave polynomial time algorithms for interval graphs, an important subclass of perfect graphs of these four vulnerability parameters. Keywords: Graph Theory, Vulnerability, Graph Algorithms, Interval Graphs, Neighbor Isolated Tenacity, Neighbor Isolated Rupture Degree