BabelNet

bn:03628853n

Noun Concept

Categories: Graph connectivity, Graph families

k-vertex-connected graph k-connected graph Vertex connectivity

In graph theory, a connected graph G is said to be k-vertex-connected if it has more than k vertices and remains connected whenever fewer than k vertices are removed. Wikipedia

Definitions

Relations

Sources

In graph theory, a connected graph G is said to be k-vertex-connected if it has more than k vertices and remains connected whenever fewer than k vertices are removed. Wikipedia

A graph that cannot be disconnected by the deletion of fewer than k vertices Wikidata

IS A

HAS KIND

HAS INSTANCE