The Number of Perfect Matchings in Six Types of Graphs
返回论文页
|更新时间:2023-12-11
|
The Number of Perfect Matchings in Six Types of Graphs
Acta Scientiarum Naturalium Universitatis SunYatseniVol. 51, Issue 2, Pages: 40-44(2012)
作者机构:
天水师范学院数学与统计学院,甘肃,天水,741001
作者简介:
基金信息:
DOI:
CLC:
Published:2012,
Published Online:25 March 2012,
扫 描 看 全 文
TANG Baoxiang, REN Han. The Number of Perfect Matchings in Six Types of Graphs. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(2):40-44(2012)
DOI:
TANG Baoxiang, REN Han. The Number of Perfect Matchings in Six Types of Graphs. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(2):40-44(2012)DOI:
The Number of Perfect Matchings in Six Types of Graphs
It is an interesting and important problem to count the number of the perfect matchings in graphs
which origin from both physics and chemistry. So far
many mathematicians
physicists and chemists gave most of their attention to counting perfect matchings of graphs. But the problem of counting the number of the perfect matchings for general graphs is NP-difficult. By applying differentiation
summation and re-recursion calculation
the several counting formulas of the perfect matching for six specific types of graphs are given. As an application
the number of one type chessboard of the 1×2 dominoes covering is calculated.
关键词
线性递推式棋盘完美匹配
Keywords
linear recurrence relationchessboardperfect matching