KVertexConnectedGraphQ

KVertexConnectedGraphQ[g,k]

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:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=

Scope  (5)

Properties & Relations  (2)

See Also

KVertexConnectedComponents  KEdgeConnectedGraphQ  VertexConnectivity  ConnectedGraphQ

Introduced in 2014
(10.0)