
Special Subgraphs
111
V −IS is a vertex cover. For any matching M and any vertex cover VC of G, |M| ≤
|VC| as each edge can only cover one edge of M. In bipartite matching of a bipartite
graph G(V
1
,V
2
), we aim to cover all edges of G as the vertex cover of a simple graph
[2].
Finding a vertex cover of maximum size is irrelevant as all of the vertices of the
graph constitute a vertex cover. A minimal vertex cover (MVC) is a vertex cover such
that removal of a vertex from MVC results in a cover that leaves at least one edge
not covered. A minimum vertex cover (MinVC) of a graph G is the set of vertices of
G that is a vertex cover with the minimum size ...