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:
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
A. 6
B. 15
C. 16
D. 22
A.6
B.15
C.16
D.22
answer:D