您当前的位置：
首页 >
文章列表页 >
The counting formula of the perfect matchings of three types of special graphs
更新时间：2023-12-11
|

    • The counting formula of the perfect matchings of three types of special graphs

    • Acta Scientiarum Naturalium Universitatis SunYatseni   Vol. 56, Issue 3, Pages: 36-40(2017)

    • Published：2017，

      Published Online：25 May 2017，

    扫 描 看 全 文

  • TANG Baoxiang, REN Han. The counting formula of the perfect matchings of three types of special graphs. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 56(3):36-40(2017) DOI：

  •  
  •  

0

Views

171

下载量

0

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

The Number of Perfect Matchings in Six Types of Graphs
The Number of Perfect Matchings in Five Types of Graphs
The analytic formula of the number of perfect matchings of two types of graphs
The Number of Perfect Matchings in Two Types of 3-Regular Graph
Three types of nested recursive methods for finding counting formulas of the number of perfect matchings

Related Author

TANG Baoxiang
REN Han
REN Han
Baoxiang TANG
Han REN

Related Institution

Department of Mathematics, East China Normal University
School of Mathematics and Statistics Institute， Tianshui Normal University
Department of Mathematics， East China Normal University
0