I'm not sure where to post this, but anyway here is the question: Given a graph G(p,q) is a tree where p is the number of vertices and q is the number of edges. Since given graph is a tree, number of edges q=p-1. How do you prove that every non-trivial tree has atleast two vertices with degree less than 2? P.S.: A tree is a connected acyclic graph.