ABSTRACT
The edge connectivity of an undirected graph G is the minimum number of edges that must be removed to disconnect G. For example, the edge connectivity of a tree is 1, and the edge connectivity of a simple cycle is 2. Similarly, the vertex connectivity of a graph is the minimum number of vertices that must be removed to disconnect it.
