Home > 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.
- Besedna vrsta: noun
- Industrija/področje: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Avtor
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
