ISRO Computer Science (CSE) 2009 - Question 55

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

In a graph G there is one and only one path between every pair of vertices then G is a

  • A. Path
  • B. Walk
  • C. Tree
  • D. Circuit

Answer: C. Tree

Explanation: A tree is a connected graph with no cycles, ensuring a unique path between any two nodes.

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