Enhancing algorithm for network robustness based on graph theory

Aimed at the cases of poor ability against vulnerable attack upon network node and poor network robustness,an enhancing algorithm for network robustness was proposed based on graph theory.The strategy for network robustness based on graph theory and diversity was introduced first,and then,the concept,categorizing description and quantitative index of node correlativity were proposed.The effect of diversity on various vulnerable node attacks was analyzed,also.The graphs derived from this algorithm with 30 nodes and 4 coloring were analyzed in detail.The statistical characters of 6 graphs generated according to this algorithm were induced,also.An actual example showed that the networks constructed according to this algorithm were more balanced network which could enhance the node ability of anti-vulnerable attacks,interdict infiltration and propagation of various possible vulnerable attacks between nodes,cut down the possibility of network cascading failure,avoid the avalanche effects so that the network would be made to have stronger robustness.