中文摘要：

图的完美匹配计数问题是匹配理论研究中的一个重要课题，此问题有很强的物理学和化学背景，历来引起众多数学家，物理学家和化学家的广泛关注。但是，一般图的完美匹配计数问题却是NP-难的。用划分，求和，再递推的方法给出了6类特殊图完美匹配数目的计算公式。作为应用，计算出了一类棋盘1×2的多米诺覆盖的数目。

英文摘要：

It is an interesting and important problem to count the number of the perfect matchings in graphs, which origin from both physics and chemistry. So far, many mathematicians, physicists and chemists gave most of their attention to counting perfect matchings of graphs. But the problem of countingthe number of the perfect matchings for general graphs is NP-difficult. By applying differentiation, sum- mation and re-recursion calculation, the several counting formulas of the perfect matching for six specific types of graphs are given. As an application, the number of one type chessboard of the 1×2 dominoes covering is calculated.