VertexConnectivity

利用可能

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

形式

VertexConnectivity[g]

VertexConnectivity[g, s, t]

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

検証済みの例VertexConnectivity[CompleteGraph[4]] → 3

Qurakで実行リファレンスを検索

トピック

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

関連

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

全 6300 関数 · MCPクライアントから使う