Question

A tree with n vertices will have atleast two vertices of degree 1

Answer 1

The heart of your argument could be boiled down to: Every tree has edges, so the the sum of the degrees of all the vertices of any tree have to be. But if there are fewer than two vertices of degree one, then the sum of the degrees of all the vertices must be at least 2 ( n − 1 ) + 1 , which is a contradiction.

Mark as a brainliest answer.