Skip to main content
Fig. 1 | Applied Network Science

Fig. 1

From: Robustness of preferential-attachment graphs

Fig. 1

Robustness of networks generated from \(\textsf {PA}(n,k)\) compared to networks drawn from \(\textsf {G}(n,m)\) and \(\textsf {G}(n,m,k)\) after \(5\%\), \(10\%\), and \(20\%\) of vertices were removed in targeted attacks or random failures, where \(n=10{,}000\), \(m=30{,}000\), and \(k=3\). The dashed lines represent the upper bounds for the robustness score as given in “Network robustness” section

Back to article page