Fig. 2.

We initially built a test network. Next, we identified the k most central nodes. We built two networks: one in which we removed the top-k central nodes and a second one in which we removed k randomly selected node. We compared the spectra of the adjacency matrices of these two networks with respect to the spectrum of the input network. We noted that the largest eigenvalues of the adjacency matrix exhibited a greater decrease when considering the removal of central nodes.