Measuring Network Vulnerability Using Graphic Integer Sequence

Networks have an important role in our daily lives. Effectiveness of the network decreases with the breaking
down of some vertices or links. So, less vulnerable communication network is required for greater stability.
Vulnerability is the measure of resistance of the network after failure of communication links. In this article
graph has been taken for modeling a network and integrity as the measure of vulnerability. The approach is to
estimate the integrity or upper bound of integrity of at least one connected graph or network constructed from
the given graphic integer sequence. Experiments have been done with random graphs, complex networks and
also a comparison between two parameters, namely vertex connectivity and graph integrity as a measure of the
network vulnerability have been carried out by removing vertices randomly from various complex networks.
Comparison with the existing method shows that the algorithm proposed in this article provides much better
Integrity measurement. Comparison between vertex connectivity and integrity shows that integrity gives better
measurement of vulnerability. This algorithm is very useful for engineers and researchers for network analysis.
Different configuration of networks can be tested to find networks with higher integrity which produce networks
with high security, reliability and robustness.