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.
Details and Options
- EdgeConnectivity is also known as line connectivity.
- 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
Examplesopen allclose all
Wolfram Research (2012), EdgeConnectivity, Wolfram Language function, https://reference.wolfram.com/language/ref/EdgeConnectivity.html (updated 2015).
Wolfram Language. 2012. "EdgeConnectivity." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/EdgeConnectivity.html.
Wolfram Language. (2012). EdgeConnectivity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/EdgeConnectivity.html