biconnected graph


Also found in: Wikipedia.

biconnected graph

[¦bī·kə′nek·təd ′graf]
(mathematics)
A connected graph in which two points must be removed to disconnect the graph.
References in periodicals archive ?
Definition 1 Let C be a class of labeled connected graphs and let B [subset] C be the class of biconnected graphs in C.
where B(x, y) is the exponential generating function enumerating the biconnected graphs in C.