Current location - Training Enrollment Network - Mathematics courses - Matching problem of dichotomy sum in discrete mathematics
Matching problem of dichotomy sum in discrete mathematics
Take V 1 = {L 1, L2, L3, L4, L5,} and V2 = {G 1, G2, G3, G4, G5, G6} as the vertex group, and if Li and Gj get married, add an edge between the two vertices, thus constructing. 6) At L3-G4 where V2 is adjacent to point K, V 1 and V2 have the same number of vertices, so V 1 matches V2 completely. Figure 1 is changed to Figure 2, and there are two complete matches in both parts of Figure 2, thus the complete match in Figure 1 is obtained: (1) L 1-G 1. L6-G5(2)L 1-G4,L2-G3,L3-G 1,L4-G2,L5-G6,L6-G5(3)L 1-G 1,L2-G5,L3-G4,L4-G6,L5-G3,L6-G2(4)L 1-G4,L2-G5,L3-G 1,L4-G6,L5