Biconnected graph

最新推荐文章于 2024-07-19 22:36:19 发布

omipus

最新推荐文章于 2024-07-19 22:36:19 发布

阅读量95

点赞数

分类专栏： Reference 文章标签：算法

本文链接：https://blog.csdn.net/qq_66485519/article/details/128510496

版权

Reference 专栏收录该内容

581 篇文章 5 订阅

订阅专栏

In graph theory, a biconnected graph is a connected and “nonseparable” graph, meaning that if any one vertex were to be removed, the graph will remain connected. Therefore a biconnected graph has no articulation vertices.

The property of being 2-connected is equivalent to biconnectivity, except that the complete graph of two vertices is usually not regarded as 2-connected.

This property is especially useful in maintaining a graph with a two-fold redundancy, to prevent disconnection upon the removal of a single edge (or connection).

The use of biconnected graphs is very important in the field of networking (see Network flow), because of this property of redundancy.

Contents
1 Definition
2 Examples
3 See also

关注博主即可阅读全文