I am trying to do this one problem for a homework set, and am not entirely sure how I would even start this proof. Here is the question
Prove, by induction on k, that a connected component of k nodes has at least k − 1 edges.
Any suggestions? Thanks in advance