The Number of Perfect Matchings in Five Types of Graphs
返回论文页
|更新时间:2023-12-11
|
The Number of Perfect Matchings in Five Types of Graphs
Acta Scientiarum Naturalium Universitatis SunYatseniVol. 51, Issue 4, Pages: 31-37(2012)
作者机构:
1. 天水师范学院数学与统计学院,甘肃,天水,741001
2. 华东师范大学数学系,上海,200062
作者简介:
基金信息:
DOI:
CLC:
Published:2012,
Published Online:25 July 2012,
扫 描 看 全 文
TANG Baoxiang, REN Han. The Number of Perfect Matchings in Five Types of Graphs. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(4):31-37(2012)
DOI:
TANG Baoxiang, REN Han. The Number of Perfect Matchings in Five Types of Graphs. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(4):31-37(2012)DOI:
The Number of Perfect Matchings in Five Types of Graphs
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.