ISRO Computer Science (CSE) 2007 - Question 6

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2007

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. Disconnected

Explanation: A graph with n vertices and n-1 edges is a tree IF AND ONLY IF it is connected. If it is not a tree, it must be disconnected.

| | All questions of ISRO Computer Science (CSE) 2007