WOLFRAM

Wolfram 语言与系统参考资料中心

VertexConnectivity[g]

gives the minimum number of vertices whose deletion from graph g disconnects it.

VertexConnectivity[g,Cut]

gives a set of vertices of minimum size whose removal disconnects the graph.

更多信息和选项
Details and Options Details and Options
范例  
基本范例  
参见
技术笔记
相关指南
按以下格式引用：
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 g disconnects it.

VertexConnectivity[g,Cut]

gives a set of vertices of minimum size whose removal disconnects the graph.

更多信息和选项

范例

基本范例  (2)

This function has been superseded by VertexConnectivity in the Mathematica kernel:

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 年

BibTeX

@misc{reference.wolfram_2025_vertexconnectivity, author="Wolfram Research", title="{VertexConnectivity}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html}", note=[Accessed: 19-April-2026]}

BibLaTeX

@online{reference.wolfram_2025_vertexconnectivity, organization={Wolfram Research}, title={VertexConnectivity}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html}, note=[Accessed: 19-April-2026]}