用划分、求和、再递推的方法分别给出了图3-nK2,2,2和2-n4XC8的完美匹配数目的计算公式,所给出的方法可以计算出许多特殊图的所有完美匹配的数目,为图的完美匹配的应用提供了理论支持.
The counting formulas of the perfect matchings for graphs 3 - nK2,2,2 and 2 - n4XCs were given by apply- ing the method of differentiation, summation and re-recursion. The method presented in this paper can calculate the number of all perfect matchings of many special graphs, which provided the theory support for the application of perfect matching in graph.