gives the vertex connectivity of the graph g.
gives the s-t vertex connectivity of the graph g.
uses rules vw to specify the graph g.
- The vertex connectivity of a graph g is the smallest number of vertices whose deletion from g disconnects g.
- The s-t vertex connectivity is the smallest number of vertices who deletion from g disconnects g with s and t in two different connected components.
- For a disconnected graph, VertexConnectivity will return 0.
Introduced in 2012
(9.0)| Updated in 2015