In our everyday lives, networks have an important role. With the breaking down of certain vertices or connections, the network’s efficiency decreases. So, for greater stability, less insecure communication networks are needed. Vulnerability is the indicator of the network’s resistance after communication links collapse. The graph for modelling a network and honesty as a measure of vulnerability was taken in this report. The strategy is to estimate at least one linked graph or network created from the given graphic integer sequence for the integrity or upper bound of integrity. As a measure of the network vulnerability, experiments were carried out with random graphs, complex networks and also a comparison between two parameters, namely vertex connectivity and graph integrity, by extracting vertices randomly from different complex networks. The comparison with the current approach indicates that the algorithm suggested in this article offers a much better calculation of honesty. The comparison of vertex connectivity and integrity shows that integrity offers better vulnerability calculation. For engineers and researchers, this algorithm is very useful for network analysis. In order to identify networks of higher credibility that generate networks with high security , reliability and robustness, different network configurations can be checked.
Department of Computer Science, Vivekananda Mission Mahavidyalaya, Vidyasagar University, India.
Dr. Samar Sen Sarma
Department of Computer Science & Engineering, University of Calcutta, Kolkata, India.
View Book :- https://bp.bookpi.org/index.php/bpi/catalog/book/307