“…In many of these studies, a wide variety of structural properties and their corresponding measures have been proposed to quantify the disruption inflicted on the graph G. In general, these measures are either associated with (1) optimal solutions to flow problems over G, such as shortest paths, maximum flow, or minimum cost flow problems [17,19,33,38,41,44,49,78,79]; (2) the sizes or relative weight of some topological node or edge structures in G, like spanning trees [28], dominating sets [47], central nodes-for example, the one-median or one-center nodes [10], matchings [80,81], independent sets [9], cliques [46], and node covers [9]; and (3) connectivity and cohesiveness properties of G, such as the total number of connected node pairs [1, 6, 21-23, 51, 52, 65, 69, 70, 72, 73], the weight of the connections between the node pairs [6,21,73], the size of the largest component [13,30,55,63,64,73], the total number of components [5,[63][64][65]68], distance-based connectivity metrics [74], and the graph information entropy [14,35,56,73].…”