الصفحة الرئيسية > 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
