连通性是图论中的基本概念，关乎网络中节点或边被最小数量地移除后，剩余节点是否能分成两个或更多孤立子图。这一特性与网络流问题紧密相关，衡量了网络的韧性。文章通过实例展示了当特定节点或边被移除时，如何导致图的不连通，并探讨了Menger定理等相关理论。
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs.[1] It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network.
This graph becomes disconnected when the right-most node in the gray area on the left is removed
This graph becomes disconnected when the dashed edge is removed.
Contents
1 Connected vertices and graphs
2 Components and cuts
2.1 Super- and hyper-connectivity
3 Menger’s theorem
4 Computational aspects
4.1 Number of connected graphs
5 Examples
6 Bounds on connectivity
7 Other properties
8 See also
扫一扫
1790
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
