On ordering of complements of graphs with respect to matching numbers

We consider an earlier much studied quasi-order, defined in terms of matching numbers of graphs, and apply it to graph complements. We establish four transformations on the complements of graphs that increase or decrease the matching numbers accordingly. Several applications of these results are put forward.