Prove that the complement of a disconnected graph is connected. Let g be a simple graph with n vertices. Show that ifo(G)>n/2-1, then g is connected t Show that a simple graph g with an vertices is connected if it has more than (n-1)(n-2)/2 edges. TheoremS, examples, and exercises Prove that the complement of a disconnected graph is connected.  Let G be a simple graph with n vertices. Show that ifδ(G) >[n/2]-1, then G is connected.  Show that a simple graph G with an vertices is connected if it has more than (n-1)(n-2)/2 edges.  Theorems, examples, and exercises