Question

Prove that a tree with more than 1 vertex has at least 2 leaves

Answer 1

Answer:

Every tree has n−1 edges, so the the sum of the degrees of all the vertices of any tree have to be 2(n−1). 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.

Hope it's helpful to you

By Amit

Answer 2

Step-by-step explanation:

Every tree has n−1 edges, so the the sum of the degrees of all the vertices of any tree have to be 2(n−1). 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.