Definition:Edge Cut

Definition
Let $G$ be a graph.

An edge cut of $G$ is a set of edges $W \subseteq E \left({G}\right)$ such that the edge deletion $G \setminus W$ is disconnected.

Also see

 * Edge Deletion
 * Vertex Cut