# KVertexConnectedGraphQ

yields True if the graph g is k-vertex-connected and False otherwise.

# Details

• KVertexConnectedGraphQ is also known as k-connected.
• A graph is k-vertex-connected if there are at least k vertex-disjoint paths between every pair of vertices.

# Examples

open allclose all

## Basic Examples(1)

Test whether a graph is 2-connected:

## Scope(5)

Test undirected graphs:

Directed graphs:

Multigraphs:

Mixed graphs:

KVertexConnectedGraphQ gives False for anything that is not a k-connected graph:

## Properties & Relations(2)

The complete graph is -connected:

An undirected tree is 1-connected:

Wolfram Research (2014), KVertexConnectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/KVertexConnectedGraphQ.html.

#### Text

Wolfram Research (2014), KVertexConnectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/KVertexConnectedGraphQ.html.

#### CMS

Wolfram Language. 2014. "KVertexConnectedGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/KVertexConnectedGraphQ.html.

#### APA

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

#### BibTeX

@misc{reference.wolfram_2022_kvertexconnectedgraphq, author="Wolfram Research", title="{KVertexConnectedGraphQ}", year="2014", howpublished="\url{https://reference.wolfram.com/language/ref/KVertexConnectedGraphQ.html}", note=[Accessed: 03-June-2023 ]}

#### BibLaTeX

@online{reference.wolfram_2022_kvertexconnectedgraphq, organization={Wolfram Research}, title={KVertexConnectedGraphQ}, year={2014}, url={https://reference.wolfram.com/language/ref/KVertexConnectedGraphQ.html}, note=[Accessed: 03-June-2023 ]}