The invulnerability of robust communication network
Wen Changjun, Xiaomeng Zhang · 2016
Due to the fully connected network with the best invulnerability, and the shortest path number between a node for network invulnerability is important. Based on the fully connected network, the shortest path number for evaluation index, the robust communication network invulnerability of the model is established. A new method of calculation of the shortest path is put forward by using MATLAB in this paper. Calculating the examples, the network of the invulnerability can be concluded. The more symmetrical the robust communication network topology is, the higher the invulnerability is.