# biconnected graph

**biconnected graph** A graph *G*, either directed or undirected, with the property that for every three distinct vertices *u*, *v*, and *w* there is a path from *u* to *w* not containing *v*. For an undirected graph, this is equivalent to the graph having no cut vertex.

Two edges of an undirected graph are said to be related either if they are identical or if there is a cycle containing both of them. This is an equivalence relation and partitions the edges into a set of equivalence classes, *E*_{1}, *E*_{2},… *E _{n}*, say. Let

*V*be the set of vertices of the edges of

_{i}*E*for

_{i}*i*= 1, 2,…

*n*. Then each graph

*G*formed from the vertices

_{i}*V*and the edges

_{i}*E*is a

_{i}*biconnected component*of

*G*.

#### More From encyclopedia.com

V , V, v [Called ‘vee’]. The 22nd LETTER of the Roman ALPHABET as used for English. It originated, along with F, U, W, Y, in the Phoenician consonant sym… Relation , RELATION
Relation, from the Latin, relatio (referre, relatum ), means a reference, bearing, or towardness, and relative signifies the substantive mea… U , U, u [Called ‘you’]. The 21st LETTER of the Roman ALPHABET as used for English. It originated in the Phoenician consonant symbol waw, the common ance… Cycle , Skip to main content
cycle
cycle •cackle, crackle, grackle, hackle, jackal, mackle, shackle, tackle •ankle, rankle •Gaskell, mascle, paschal •taberna… Boolean Algebra , Boolean algebra is often referred to as the algebra of logic, because the English mathematician George Boole, who is largely responsible for its begi… W , W, w [Called ‘double-you’]. The 23rd LETTER of the modern Roman ALPHABET as used for English. The Romans had no letter suitable for representing the…

#### You Might Also Like

#### NEARBY TERMS

**biconnected graph**