To prove the minimality of the set MFIS(X), we will show that for any set N ..... Prove that for a non-empty regular bipartite graph the number of vertices in both.

Let us define A = {v1,...,vm} and B = V (G)−A. We split the sum m. ∑ i=1 di into two parts m. ∑ i=1 di = C + D, where C is the contribution of the edges with both ...

The degree of v ∈ V (G), denoted deg(v), is the number of edges incident with v. Alterna- tively, deg(v) = |N(v)|. Definition 3 The complement of a graph G = (V,E) is a graph with vertex set V and edge set. E such that e ∈ E if and only if e ∈