Solved: Show that a simple graph G with n vertices is
Chapter 9, Problem 9.4.43(choose chapter or problem)
Show that a simple graph G with n vertices is connected if it has more than (n - 1 )(n - 2)/2 edges.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer