TANG Baoxiang, REN Han. The Number of Perfect Matchings in Five Types of Graphs[J]. Acta Scientiarum Naturalium Universitatis SunYatseni, 2012,51(4):31-37.
TANG Baoxiang, REN Han. The Number of Perfect Matchings in Five Types of Graphs[J]. Acta Scientiarum Naturalium Universitatis SunYatseni, 2012,51(4):31-37.DOI:
Matching counting theory is the core of graph theory. Since it has important applications and is in connection with other theoretic problems closely
it has been studied extensively.And many celebrated results have been established. But the problem of counting the number of perfect matchings for general graphs is
NP
-hard. By applying differentiation
summation and rerecursion calculation
several counting formulas of the perfect matchings for five specific types of graphs are given. The number of all perfect matchings of many bipartite graphs can be calculated with this method.