|
GraphTheory[IsTwoEdgeConnected]
GraphTheory[TwoEdgeConnectedComponents]
|
|
Calling Sequence
|
|
IsTwoEdgeConnected(G)
TwoEdgeConnectedComponents(G)
|
|
|
Description
|
|
|
•
|
A connected graph G is 2-edge connected if removal of any edge from G does not disconnect G. The IsTwoEdgeConnected command returns true if G is 2-edge connected and false otherwise.
|
|
•
|
TwoEdgeConnectedComponents returns the 2-edge connected components of a graph G. The output is a list of lists of vertices of G, each being the list of vertices of a component.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
>
|
|
|
| (3) |
|
>
|
|
|
>
|
|
|
![[[d, e, f], [a, b, c, h, i]]](/support/helpjp/helpview.aspx?si=6092/file01847/math110.png)
| (4) |
|
|
Download Help Document
Was this information helpful?
