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.

[1]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[2]  Wu Jun,et al.  Natural Connectivity of Complex Networks , 2010 .

[3]  Xueliang Li,et al.  Computing the Scattering Number of Graphs , 2002, Int. J. Comput. Math..

[4]  Yilun Shang,et al.  Vulnerability of networks: fractional percolation on random graphs. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Ferhan Nihan Altundag,et al.  Neighbor Rupture Degree of Some Middle Graphs , 2017 .

[6]  Wayne Goddard,et al.  A Survey of Integrity , 1992, Discret. Appl. Math..

[7]  Yilun Shang,et al.  Estrada and L-Estrada Indices of Edge-Independent Random Graphs , 2015, Symmetry.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Shinya Fujita,et al.  Safe number and integrity of graphs , 2018, Discret. Appl. Math..

[10]  Yilun Shang,et al.  Biased edge failure in scale-free networks based on natural connectivity , 2012 .

[11]  Lynne L. Doty.  Extremal connectivity and vulnerability in graphs , 1989, Networks.

[12]  Ersin Aslan,et al.  Weak-Rupture Degree of Graphs , 2016, Int. J. Found. Comput. Sci..

[13]  Yilun Shang,et al.  Large dicliques in a directed inhomogeneous random graph , 2013, Int. J. Comput. Math..

[14]  Pim van 't Hof,et al.  On the Computational Complexity of Vertex Integrity and Component Order Connectivity , 2014, Algorithmica.

[15]  Xiaofeng Gu,et al.  Spectrum bounds for the scattering number, integrity, tenacity of regular graphs , 2017, Future Gener. Comput. Syst..

[16]  A. Aytaç.  The common-neighbourhood of a graph , 2017 .

[17]  Sankar Sahoo,et al.  Concept of integrity and its value of fuzzy graphs , 2018, J. Intell. Fuzzy Syst..

[18]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .