EdgeConnectivity

EdgeConnectivity[g]

gives the edge connectivity of the graph g.

EdgeConnectivity[g,s,t]

gives the s-t edge connectivity of the graph g.

EdgeConnectivity[{vw,},]

uses rules vw to specify the graph g.

Details and Options

  • 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:
  • EdgeWeightAutomaticedge weight for each edge

Examples

open allclose all

Basic Examples  (2)

Find the edge connectivity:

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

Find the edge connectivity between two vertices:

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

Scope  (7)

Options  (1)

Properties & Relations  (3)

See Also

VertexConnectivity  ConnectedComponents  CompleteGraph

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