bn:03628853n
Noun Concept
IT
No term available
EN
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
Relations
Sources