The edge connectivity of a graph is the minimum number of edges you must remove to disconnect the graph. It equals the capacity of the global minimum cut (when all edges have capacity ). If the edge connectivity is , the graph remains connected after removing any edges, but becomes disconnected if you remove some set of edges.
Higher edge connectivity means a more reliable network.