Wolfram Language & System 10.0 (2014)|Legacy Documentation
This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)
gives the vertex connectivity of the graph g.
gives the s-t vertex connectivity of 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 .
Introduced in 2012