KEdgeConnectedGraphQ

KEdgeConnectedGraphQ[g,k]
yields True if the graph g is k-edge-connected and False otherwise.

DetailsDetails

  • A graph is k-edge-connected if there are at least k edge-disjoint paths between every pair of vertices.

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

Test whether a graph is 2-edge-connected:

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

A graph with isolated vertices is not k-edge-connected:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Introduced in 2014
(10.0)