Advanced Search

Question: How to find a smallest vertex cut of the graph g?

Question:How to find a smallest vertex cut of the graph g?

lcz 1029 Maple
graph-theory
December 03 2021
2

 The vertex connectivity of a graph  is the minimum number of vertices whose removal disconnects the  
  graph. With Maple, it's easy to get the connectivity of a graph, but  I can not  find a smallest vertex cut of 
the graph g by maple. 

 If a graph has some cut vertices, I see that the function ArticulationPoints seems to be able to solve.
 But for general smallest vertex cut, I don’t see a suitable function.  For example

with(GraphTheory):
G:=CompleteGraph(2,2,2,2);
DrawGraph(G);
VertexConnectivity(G)

6

This seems easy to do in Mathematica. See https://reference.wolfram.com/language/ref/FindVertexCut.html.
Please Wait...