Macaulay2 » Documentation
Packages » Graphs :: minimalVertexCuts
next | previous | forward | backward | up | index | toc

minimalVertexCuts -- finds the minimal vertex cuts of a graph



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

i1 : G = graph({{1,2},{2,3},{3,1},{3,4},{4,5},{5,3}},EntryMode=>"edges");
i2 : minimalVertexCuts G

o2 = {{3}}

o2 : List

See also

Ways to use minimalVertexCuts :

For the programmer

The object minimalVertexCuts is a method function.