Combinatorica`
Combinatorica`
VertexConnectivity
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
VertexConnectivity[g]
gives the minimum number of vertices whose deletion from graph 
disconnects it.
VertexConnectivity[g,Cut]
gives a set of vertices of minimum size whose removal disconnects the graph.
更多信息和选项
- VertexConnectivity functionality is now available in the built-in Wolfram Language function VertexConnectivity.
- To use VertexConnectivity, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
Wolfram Research (2012)，VertexConnectivity，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.
文本
Wolfram Research (2012)，VertexConnectivity，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.
CMS
Wolfram 语言. 2012. "VertexConnectivity." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.
APA
Wolfram 语言. (2012). VertexConnectivity. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html 年