Graph, Theory, Math, Mathematics, Trees.
vertices unless it has only one vertex. Proof: Consider the base case, with two vertices. Each vertex has exactly one neighbor, making them both leaves. Consider the induction step. When you add a vertex, the vertex can only have one neighbor. If it has two neighbors (or more), A and B, then there