本文研究了4类特殊图完美匹配数目的显式表达式.利用划分,求和,再递推的方法分别给出了图3-n Z4,2-n(2-C6),2-n(2-K4)和3-n(C4-C6)的完美匹配数目的计算公式.
In this paper, we study the explicit expression of the perfect matching number of four types of graphs. By using differentiation, summation and re-recursion, the counting formula of the perfect matching for graphs 3 - nZ4, 2 - n(2 - C6), 2 - n(2 - K4) and 3 - n(C4 - C6) is made.