The number of four types of graphs of perfect matchings nested recursive method for finding[J]. Journal of South China Normal University (Natural Science Edition), 2014, 46(1): 17-21.
Citation:
The number of four types of graphs of perfect matchings nested recursive method for finding[J]. Journal of South China Normal University (Natural Science Edition), 2014, 46(1): 17-21.
The number of four types of graphs of perfect matchings nested recursive method for finding[J]. Journal of South China Normal University (Natural Science Edition), 2014, 46(1): 17-21.
Citation:
The number of four types of graphs of perfect matchings nested recursive method for finding[J]. Journal of South China Normal University (Natural Science Edition), 2014, 46(1): 17-21.
The counting formula of the perfect matching for graphs 3-n3LC4,3-nBC4, 3-nL4 and 1-nXC4 is made by applying differentiation, summation and re-recursion in this paper. By the method presented in this paper, the numbers of all perfect matchings of many particular graphs can be calculated. The number of Hamilton cycles of some graphs has been calculated.
DownLoad: