Definition:Vertex Cut

Definition
Let $G = \struct {V, E}$ be a graph.

A vertex cut of $G$ is a set of vertices $W \subseteq \map V G$ such that the vertex deletion $G \setminus W$ is disconnected.

Also see

 * Definition:Vertex Deletion


 * Definition:Cut-Vertex: a singleton vertex cut