Show that a simple graph G with n vertices is connected if it has more than (n

Question:

Show that a simple graph G with n vertices is connected if it has more than (n − 1) (n − 2)/2 edges.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: