Graph, Theory, Math, Mathematics, Trees.
Here’s a little hint: use Induction. Answer: it has n-1 edges. Consider the base case, where a tree has 1 vertex. It is a simple graph, so it can’t have anything other than no edges. Now consider the induction step. We add a new vertex, which has to be a leaf according to the above Lemma. This new