Bi-connected graph

It is not enough to know that a graph is

connected; we may need to know how well connected a connected graph
is. A connected graph may contain a vertex whose removal with its
incident edges would break the graph into two or more pieces or we can
say disconnect the remaining vertex. Such vertex called articulation
vertex or cut vertex. A graph with articulation point called separable. A
graph with no articulation point called bi-connected. In other words, a
graph is bi-connected if and only if any vertex is deleted, the graph
remains connected.
A connected graph is bi-connected if the removal of any single vertex (and all
edges incident on that vertex) cannot disconnect the graph.

Properties of Biconnected Graphs

There are two disjoint paths between any two vertices.

There is a cycle through any two vertices.

SEA
SFO

MSN

PVD

ORD

DEN

STL

LAX
DFW

LGA
ATL
MIA

Bi-connected component A maximal bi-connected sub-graph

of a graph is called bi-connected component or block. Any connected
graph decomposes into a tree of bi-connected components called the
block tree of the graph. The blocks are attached to each other at shared
vertices called cut vertices or articulation points. Specifically, a cut
vertex is any vertex whose removal increases the number of connected
components.
-

A bi-connected component of a graph is a maximal bi-connected

sub-graph- a bi-connected sub-graph that is not properly contained
in a larger bi-connected sub-graph.

A graph that is not bi-connected can divide into bi-connected

components, sets of nodes mutually accessible via two distinct
paths.

SEA
SFO

MSN

PVD
ORD

DEN

STL

LAX
DFW

- Bi-connected components are edge-disjoint but share cut-vertices.

LGA
ATL
MIA

Cut-vertices - A Cutvertex (separation vertex) is one whose removal

disconnects the graph. A vertex v is called a cut vertex of the graph G if
removing the vertex v and the boundary edges from G results in more
components than G. A vertex v inn a graph G is called an articulation point
if and only if there exist two vertices x and y such that path between x
and y passes through v; this case only in this case removal of v destroy all
path between x and y in G(i.e., disconnected G).