 Edge connectivity

Edge connectivity $\lambda (G)$ is the smallest number of edges whose deletion disconnects the graph.