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[{vw,},]

uses rules vw to specify the graph g.

Details

  • A vertex cut of a graph g is a list of vertices whose deletion from g disconnects g.
  • The s-t vertex cut is a list of vertices whose deletion from g disconnects g, with s and t in two different connected components.
  • For a disconnected graph, FindVertexCut will return an empty list {}.

Examples

open allclose all

Basic Examples  (2)

Find a smallest vertex cut:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=

Highlight a vertex cut:

In[4]:=
Click for copyable input
Out[4]=

Find a smallest vertex cut between two vertices:

In[1]:=
Click for copyable input
Out[1]=

Scope  (6)

Properties & Relations  (1)

See Also

VertexConnectivity

Introduced in 2012
(9.0)
| Updated in 2015
(10.3)