Graph theory defines resilience such that: if graph G has property P, what is the minimum number of edges (E) (links) that need to be removed so that G no longer has P?