Fig. 2.

(a) The number of nodes of the largest (LCC) and second-largest (SLCC) connected component $C_1$ (black square) and $C_2$ (red circle) versus the degree threshold $d_t$. (b) The number of nodes in $N(d_t)$ as a function of $d_t$ and the number of nodes of the second-largest component $C_2(d_t;j)$ versus ranked label j. The critical node (223) is determined as the maximal second-largest connected component disappears. (For interpretation of the references to color in this figure, the reader is referred to the web version of this article.)