A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Which two of the following are equivalent for an undirected graph G?

(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n-1) edges
(iv) G has n edges
a. (i) and (ii)
b. (i) and (iii)
c. (i) and (iv)
d. (ii) and (iii)
Answer:(i) and (iii)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: