FindVertexCut

FindVertexCut[g] finds a smallest vertex cut of the graph g.

FindVertexCut[g, s, t] finds a smallest s-t vertex cut of the graph g.

FindVertexCut[{v->w, ...}, ...] uses rules v->w to specify the graph g.

Examples

Find the vertex cut of a graph:

FindVertexCut[CompleteGraph[5]]

Something isn't working? Report an issue.

Please visit the official Wolfram Language Reference for more details.