TANG Baoxiang, REN Han. Three types of nested recursive methods for finding counting formulas of the number of perfect matchings[J]. Acta Scientiarum Naturalium Universitatis SunYatseni, 2018,57(4):72-75.
TANG Baoxiang, REN Han. Three types of nested recursive methods for finding counting formulas of the number of perfect matchings[J]. Acta Scientiarum Naturalium Universitatis SunYatseni, 2018,57(4):72-75.DOI:
Perfect matching counting problems of graph has been proven to be NP-hard
so to get the number of perfectly matched general graph is very difficult. The issue has important applications in quantum chemistry
crystal physics and computer science. Research on this issue has very important theoretical and practical significance. The counting formula of the perfect matching for graphs 2-
n
D
4
2-
n
C
6
3
and 3-
nC
6
is given by applying differentiation
summation and re-recursion. Many graphs of the number of all perfect matchings can be calculated by this method. The given method also is able to get the possibility that the perfect graphs match with the counting of all perfect matching.