KVertexConnectedGraphQ
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 all close allScope (5)
KVertexConnectedGraphQ gives False for anything that is not a k-connected graph:
Related Guides
History
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_2025_kvertexconnectedgraphq, author="Wolfram Research", title="{KVertexConnectedGraphQ}", year="2014", howpublished="\url{https://reference.wolfram.com/language/ref/KVertexConnectedGraphQ.html}", note=[Accessed: 11-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_kvertexconnectedgraphq, organization={Wolfram Research}, title={KVertexConnectedGraphQ}, year={2014}, url={https://reference.wolfram.com/language/ref/KVertexConnectedGraphQ.html}, note=[Accessed: 11-August-2025]}