MCQ
Q.
State True or False.i) An undirected graph which contains no cycles is called forest.ii) A graph is said to be complete if there is an edge between every pair of vertices.
Correct Answer: A
None.