2 M={el,e3,e7,e8}, MIel, e3, e5, e61 e 3 MI and m are perfect matching. e e e8 e 62 Definition 38: A matching M of g is perfect if all vertices of g are M-saturated. If g(vi;v2)is a 8 bipartite graph then a matching M of g that saturates all the vertices in VI is called a complete matching from VI to V2.▪ Definition 38: A matching M of G is perfect if all vertices of G are M-saturated. If G(V1;V2) is a bipartite graph then a matching M of G that saturates all the vertices in V1 is called a complete matching from V1 to V2. M={e1,e3,e7,e8}, M1={e1,e3,e5,e6} M1 and M are perfect matching