Role of Graphic Integer Sequence in the Determination of Graph Integrity.

Networks have an important role in our daily lives. The effectiveness of the network decreases with the breaking down of some vertices or links. Therefore, a 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, a graph has been taken for modeling a network and integrity as a 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 the vertex connectivity and graph integrity as a measure of the network vulnerability have been carried out by removing vertices randomly from various complex networks. A comparison with the existing method shows that the algorithm proposed in this article provides a much better integrity measurement. [ABSTRACT FROM AUTHOR]