|
GraphTheory[IsBiconnected]
GraphTheory[BiconnectedComponents]
GraphTheory[Blocks]
|
|
Calling Sequence
|
|
IsBiconnected(G)
BiconnectedComponents(G)
Blocks(G)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected unweighted graph
|
|
|
|
|
|
Description
|
|
|
•
|
A connected graph G is bi-connected or 2-connected if removal of any vertex from G does not disconnect G. Bi-connected graphs are also called blocks.
|
|
•
|
The IsBiconnected command returns true if the input graph is a 2-connected graph. It returns false otherwise.
|
|
•
|
The Blocks and BiconnectedComponents commands return a list the vertices of all blocks of the graph, namely maximal 2-connected subgraphs of G.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
![[[4, 5], [1, 2], [2, 3, 4], [5, 6, 7]]](/support/helpjp/helpview.aspx?si=6026/file01828/math106.png)
| (3) |
|
>
|
|
|
![[2, 4, 5]](/support/helpjp/helpview.aspx?si=6026/file01828/math113.png)
| (4) |
|
>
|
|
|
| (5) |
|
|
Download Help Document
Was this information helpful?
