Combinatorica`
Combinatorica`

EdgeConnectivity

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

EdgeConnectivity[g]

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

EdgeConnectivity[g,Cut]

gives a set of edges of minimum size whose deletion disconnects the graph.

更多信息和选项

范例

基本范例  (2)

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

Wolfram Research (2012),EdgeConnectivity,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/EdgeConnectivity.html.

文本

Wolfram Research (2012),EdgeConnectivity,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/EdgeConnectivity.html.

CMS

Wolfram 语言. 2012. "EdgeConnectivity." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/EdgeConnectivity.html.

APA

Wolfram 语言. (2012). EdgeConnectivity. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/EdgeConnectivity.html 年

BibTeX

@misc{reference.wolfram_2024_edgeconnectivity, author="Wolfram Research", title="{EdgeConnectivity}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/EdgeConnectivity.html}", note=[Accessed: 21-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_edgeconnectivity, organization={Wolfram Research}, title={EdgeConnectivity}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/EdgeConnectivity.html}, note=[Accessed: 21-November-2024 ]}