VertexConnectivity

Available

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

Forms

VertexConnectivity[g]

VertexConnectivity[g, s, t]

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

Verified examplesVertexConnectivity[CompleteGraph[4]] → 3

Run this on Qurak Search the reference

Topics

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

Related

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

All 6300 functions · Use this from an MCP client