Question:

Which of the following statements is true?

Show Hint

Remember that a tree is a connected acyclic graph.
Updated On: May 3, 2025
  • Some trees are graphs
  • All graphs are trees
  • All trees are graphs
  • No tree is a graph
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

In graph theory, a tree is a special type of graph that is connected and has no cycles.
Therefore, all trees are graphs, but not all graphs are trees because graphs can have cycles and may not be connected.
Thus, the correct answer is \( \text{All trees are graphs} \).
Was this answer helpful?
0
0