Node robust algorithm study based on graph theory

An enhancing algorithm for node robustness based on graph theory is proposed, which focus on the situation of poor network robust caused by the weak ability of anti-vulnerable attacks of nodes. The strategy for node and network robust based on graph coloring theory and diversity is introduced first, the graph derived from the algorithm with 35 nodes and 4 coloring plan is analyzed in detail; 4 kinds of benchmark network that usually using are also used for contrastive analyze to the algorithm and random algorithm. The examples show that the network constructed according to the algorithm can enhance the nodes ability of anti-vulnerable attacks, interdicting the exploit and propagation of various possible vulnerable attacks between nodes, such network has stronger robustness.