vertexCuts -- lists all the vertex cuts of a graph

Synopsis

Usage:

C = vertexCuts G
Inputs:
- G, an instance of the type Graph,
Outputs:
- C, a list, the list of vertex cuts of a graph

Description

A vertex cut is a set of vertices that, when removed from a graph, make the graph have more than one component. The complete graph has no vertex cuts, so the method returns an empty list.

i1 : G = cycleGraph 5;

i2 : vertexCuts G

o2 = {{0, 2}, {0, 3}, {1, 3}, {0, 1, 3}, {0, 2, 3}, {1, 4}, {2, 4}, {0, 2,
     ------------------------------------------------------------------------
     4}, {1, 2, 4}, {1, 3, 4}}

o2 : List

Ways to use `vertexCuts` :

"vertexCuts(Graph)"

For the programmer

The object vertexCuts is a method function.

vertexCuts -- lists all the vertex cuts of a graph

Synopsis

Description

See also

Ways to use vertexCuts :

For the programmer

Ways to use `vertexCuts` :