Consider two cases here
1) To make it simple , we take a 5 vertex graph,
Consider your approach ....
Now each vertex must be having atleast a degree of 2.
So total number of edges i get are = 6edges.
2) Consider the above approach
Now one side is fully connected => gives 6 edges
adding one edge makes it to connect entire graph = > 7 edges.
BUT ,Consider (1) ,, i can show a graph with 6 edges and is not connected .(connecting everything on one side)
but one cannot show a graph with 7 edges and not connected.