连通图 Connectivity (graph theory)
（重定向自Weakly connected）
在图论中，连通图基于连通的概念。在一个无向图G中，若从顶点![v_i](/Images/godic/202502/20/f0e66f55342ef85ba8be3415dd92d8e23645.png")
到顶点![v_j](/Images/godic/202502/20/275dc431f9270317c68595220d6b87303645.png")
有路径相连（当然从到也一定有路径），则称和是连通的。如果G是有向图，那幺连接和的路径中所有的边都必须同向。如果图中任意两点都是连通的，那幺图被称作连通图。图的连通性是图的基本性质。
Weakly connected
中文百科
英语百科
Connectivity (graph theory) 连通图
（重定向自Weakly connected）
![This graph becomes disconnected when the right-most node in the gray area on the left is removed](/Images/godic/202502/20/Network_Community_Structure.svg3645.png")
![This graph becomes disconnected when the dashed edge is removed.](/Images/godic/202502/20/Sample-graph3645.jpg")
![With vertex 0 this graph is disconnected, the rest of the graph is connected.](/Images/godic/202502/20/UndirectedDegrees.svg3645.png")
![Graphe connexe.](/Images/godic/202502/20/Halin_graph.svg3645.png")
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 disconnect the remaining nodes from each other. 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.
- Ophiotaurus
- ophiothamnus
- ophiothamnuss
- ophiothela danae
- Ophiotholia
- ophiotholias
- ophiothricid
- ophiothricids
- ophiothrix aspidota
- ophiothrix ciliaris
- ophiothrix exigua
- Ophiothrix fragilis
- ophiothrix hybrida
- ophiothrix plana
- ophiothrix propinqua
- ophiothrix savignyi
- ophiothrix striolata
- ophiothrix trilineata
- ophiothrix vicina
- ophiothrix vincina
- ophiotoma
- ophiotomas
- ophiotominae
- ophiotoxemia
- ophiotoxemia, ophitoxemia