ホーム > Term: k-connected graph
k-connected graph
A connected graph such that deleting any k-1 vertices (and incident edges) results in a graph that is still connected.
- スピーチの一部 noun
- 産業/ドメイン コンピュータサイエンス
- カテゴリ Algorithms & data structures
- Government Agency: NIST
0
作成者
- GeorgeV
-
(Gold) 1123 ポイント - 100% positive feedback
