The relation between size of a maximum matching in a disconnected graph G on vertex set V and the size of a maximum matching of a connected graph G on same vertex set V is
(D) None of the above.
Have a look at this:
Left half is disconnected graph.
So, here, Md<Mc.
This was from Gatebbok, right?
In d link mentioned below. Yeah. :)