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.

Details

Examples

Basic Examples  (2)

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

Wolfram Research (2012), VertexConnectivity, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.

Text

Wolfram Research (2012), VertexConnectivity, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.

BibTeX

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

BibLaTeX

@online{reference.wolfram_2021_vertexconnectivity, organization={Wolfram Research}, title={VertexConnectivity}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html}, note=[Accessed: 16-September-2021 ]}

CMS

Wolfram Language. 2012. "VertexConnectivity." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.

APA

Wolfram Language. (2012). VertexConnectivity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html