-->
当前位置:首页 > 题库 > 正文内容

Multiple choice:If an undirected graph G = (V, e) contains 8 vertices, the minimum number of edges required to ensure that G is connected in any case is:

Luz3年前 (2021-05-10)题库310
If an undirected graph G = (V, e) contains 8 vertices, the minimum number of edges needed to ensure that G is connected in any case is: @ [D] (2)
A. 6
B. 15
C. 16
D. 22




A.6
B.15
C.16
D.22


answer:D

发表评论

访客

◎欢迎参与讨论,请在这里发表您的看法和观点。