Answer Happy

Posted: **Tue Jul 05, 2022 10:19 am**

: Question 1 20 Points Let G Be A Simple Graph With N Vertices Prove By Induction On The Number Of Edges Of G That If 1 (5.43 KiB) Viewed 9 times

QUESTION 1. [20 POINTS] Let G be a simple graph with n vertices. Prove by induction on the number of edges of G that, if G has k components, then G has at least n - k edges.