A graph with n vertices and n-1 edges that is not a tree, is
20072007
A graph with n vertices and n-1 edges that is not a tree, is
- A.
Connected
- B.
Disconnected
- C.
Euler
- D.
A circuit
Attempted by 84 students.
Show answer & explanation
Correct answer: B
A tree with n vertices is defined as a connected graph having exactly n-1 edges.
If a graph has n vertices and n-1 edges but is not a tree, it cannot be connected. If it were connected with n-1 edges, it would satisfy the definition of a tree.
Therefore, the graph must be disconnected.
A video solution is available for this question — log in and enroll to watch it.