Vertex cut
Материал из WEGA
Vertex cut --- вершинное сечение.
A set [math]\displaystyle{ S }[/math] of vertices of a graph [math]\displaystyle{ G }[/math] is called a vertex cut of [math]\displaystyle{ G }[/math], if [math]\displaystyle{ G \setminus S }[/math] has more connected components than [math]\displaystyle{ G }[/math]. See also Vertex connectivity.
