Definition 37: If M is a matching in a graph G. a vertex v is said to be m-saturated if there is an edge in M incident on v. Vertex v is said to be m-unsaturated if there is no edge in m incident onv M={el,e7},M3={el,e2,e5,e6} MI-saturated: v /e2 MI-unsaturated: u M3-saturated: uv e▪ Definition 37: If M is a matching in a graph G, a vertex v is said to be M-saturated if there is an edge in M incident on v. Vertex v is said to be M-unsaturated if there is no edge in M incident on v. M1={e1,e7}, M3={e1,e2,e5,e6} M1-saturated : v M1-unsaturated: u M3-saturated:u,v