All trees with n vertices consists of n-1 edges.

Category: QuestionsAll trees with n vertices consists of n-1 edges.
Editor">Editor Staff asked 4 weeks ago

All trees with n vertices consists of n-1 edges.
 
(a) True
 
(b) False
 
My question is taken from Undirected Graph in division Graph of Data Structures & Algorithms I
 
I had been asked this question in an internship interview.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right choice is (a) True
 
To explain: A trees is acyclic in nature.