Definition 36: A matching M in a graph g(v; e)is a subset of the edge set e such that no two edges in M are incident on the same vertex. The size of a matching M is the number of edges in M. For a graph G(v; E), a matching of maximum size is called a maximum matching M1={el,e7},M2={el,e2,e5},M3 Rel, e2, e5, e6and M4 e2 Rel, e2, e7, e8 are matching. M3 and m4 are maximum matching 98▪ Definition 36: A matching M in a graph G(V;E) is a subset of the edge set E such that no two edges in M are incident on the same vertex. The size of a matching M is the number of edges in M. For a graph G(V;E), a matching of maximum size is called a maximum matching. M1={e1,e7},M2={e1,e2,e5},M3 ={e1,e2,e5,e6}and M4= {e1,e2,e7,e8} are matching. M3 and M4 are maximum matching