ISRO | ISRO CS 2007 | Question 6

A graph with n vertices and n-1 edges that is not a tree, is
(A) Connected
(B) Disconnected
(C) Euler
(D) A circuit


Answer: (B)

Explanation: If a graph has n vertices and n-1 edges and it is not a tree than its a disconnected graph which contains at least a cycle.

Option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Save