Wolfram Language & System 11.0 (2016)|Legacy Documentation
This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)
gives the edge connectivity of the graph g.
gives the s-t edge connectivity of the graph g.
uses rules vw to specify the graph g.
- The edge connectivity of a graph g is the smallest number of edges whose deletion from g disconnects g.
- The s-t edge connectivity is the smallest number of edges whose deletion from g disconnects g, with s and t in two different connected components.
- For weighted graphs, EdgeConnectivity gives the smallest sum of edge weights.
- For a disconnected graph, EdgeConnectivity will return 0.
- The following option can be given:
EdgeWeight Automatic edge weight for each edge
Introduced in 2012
(9.0)| Updated in 2015