if a simple graph with n vertices is necessarily connected the minimum and maximum number of
Minimum number of edges = connect n-1 vertices completely and then add one more edge.
= ((n-1)(n-2)/2) +1
Maximum edges = make a complete grapth with n vertices = n(n-1)/2 = nC2