Definition:Edge Cut

Definition
Let $G$ be a graph.

An edge cut of $G$ is a set of edges $W \subseteq \map E G$ such that the edge deletion $G \setminus W$ is disconnected.

Also see

 * Definition:Edge Deletion
 * Definition:Vertex Cut