Computer Science · Graph Theory
Which of the following properties properly define whether a given graph is a tree? (A) Connected and acyclic graph (B) A graph with n vertices and n - 1 edges containing no cycles (C) Graph with cycles (D) Disconnected acyclic graph Choose the correct statement(s) that define a tree:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A), (B), (C) and (D) Only
- 2(A) and (D) Only
- 3(A), (B) and (D) Only
- 4(A) and (B) Only✓
Correct answer
(A) and (B) Only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Theory MCQs →Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory