We were given an this question in my class:
Prove that a forest with n vertices and m components has n-m edges using induction on m.
Induction is not my strongest point and I was wondering if anyone could help me out with this?
We were given an this question in my class:
Prove that a forest with n vertices and m components has n-m edges using induction on m.
Induction is not my strongest point and I was wondering if anyone could help me out with this?