k-vertex-connected graph

graph with more than k vertices that cannot be disconnected by the deletion of fewer than k vertices

en-GB/ˈkeɪ - ˈvɜːtɛks - kəˈnɛktɪd ɡɹɑːf/
en-US/ˈkeɪ - ˈvɝˌtɛks - kəˈnɛktɪd ˈɡɹæf/

ক্যাটাগরি:

connected graph