Abstract: The counting formulas of the perfect matchings for graphs 3-nK 2,2,2 and  2-n4XC₈ were given by applying the method of differentiation, summation and rerecursion. 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.