Superconnected graph

Superconnected graph --- суперсвязный граф.

A graph [math]\displaystyle{ G }[/math] is said to be superconnected if, for every minimum vertex cut (cut set of vertices) [math]\displaystyle{ C }[/math] of [math]\displaystyle{ G }[/math], [math]\displaystyle{ G \setminus C }[/math] has isolated vertices. See also Connected graph.