研究了3-正则Halin图的完美匹配计数问题,给出了3-正则Halin图的完美匹配数的一个递推公式.同时,本文还给出了两类特殊Halin图的完美匹配数下界的计算公式.
In this paper,the problem of counting the number of perfect matchings of a cubic Halin graph is studied. A recurrence formula of calculating the number of perfect matchings of a cubic Halin graph is given. And the counting formulae of the perfect matchings for two special Halin graphs are determined.