首页 >  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.

0 0

创建者

  • GeorgeV
  •  (Gold) 1123 分数
  • 100% positive feedback
© 2024 CSOFT International, Ltd.