Question

Prove that in any tree with two or more vertices, there are at least two pendant vertices

Answer 1

(1) Prove that every tree with more than one vertex has at least two vertices of degree one. A tree is connected so there are no vertices of degree zero. Suppose for a contradiction that there are v vertices and v − 1 have degree at least two. ... (2) Prove that any connected graph on n vertices has at least n−1 edges.

Mark as a brainliest answer.