The Invulnerability of Emergency Logistics Network Based on Complex Network

Aim at the performance evaluation of emergency logistics network. the network's invulnerability is analyzed by the average inverse geodesic length and the size of the largest connected subgraph in this paper. For each case of attacks on vertices and edges, different attacking strategies are used: removals by the descending order of the degree and the betweenness centrality. It is found that the random attack and the maximum edge-betweenness centrality attack are often less damage than select attacks and maximum vertice-betweenness centrality attacks. The invulnerability is weak based on the removals by the recalculated degrees when more vertices are attacked.