VertexConnectivity

Khả dụng

Minimum vertex cut size (s-t form uses vertex-disjoint paths)

Dạng

VertexConnectivity[g]

VertexConnectivity[g, s, t]

VertexConnectivity[{v -> w, …}, …]

Ví dụ đã kiểm chứngVertexConnectivity[CompleteGraph[4]] → 3

Chạy cái này trên Qurak Tìm trong tài liệu tham chiếu

Chủ đề

Graph Components - Vertex Connectivity
Graph Measures - Connectivity Measures
Graph Properties And Measurements - Connectivity Measures
New In90 Alphabetical Listing - V
New In90 Mathematics And Algorithms - Graphs & Networks »
Summary Of New Features In140 - Graphs

Liên quan

EdgeConnectivity ConnectedComponents HararyGraph WeaklyConnectedComponents AdjacencyList ConnectedGraphComponents EdgeAdd EdgeCount EdgeDelete EdgeIndex EdgeList EmptyGraphQ

Tất cả 6300 hàm · Dùng cái này từ một client MCP