Fig. 2From: Robustness of preferential-attachment graphsRobustness of networks generated from \(\textsf {PA}(n,k)\) compared to networks drawn from \(\textsf {G}(n,m)\) and \(\textsf {G}(n,m,k)\) after \(25\%\), \(30\%\) and \(40\%\) 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” sectionBack to article page