Combinatorica`
Combinatorica`

VertexConnectivityGraph

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

VertexConnectivityGraph[g]

returns a directed graph that contains an edge corresponding to each vertex in g and in which edge-disjoint paths correspond to vertex-disjoint paths in g.

Details and Options

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

Text

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

CMS

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

APA

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

BibTeX

@misc{reference.wolfram_2025_vertexconnectivitygraph, author="Wolfram Research", title="{VertexConnectivityGraph}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivityGraph.html}", note=[Accessed: 01-July-2025 ]}

BibLaTeX

@online{reference.wolfram_2025_vertexconnectivitygraph, organization={Wolfram Research}, title={VertexConnectivityGraph}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivityGraph.html}, note=[Accessed: 01-July-2025 ]}