吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

两类图完美匹配的计数公式

唐保祥1, 任韩2   

  1. 1. 天水师范学院 数学与统计学院, 甘肃 天水 741001; 2. 华东师范大学 数学系, 上海 200062
  • 收稿日期:2015-10-08 出版日期:2016-07-26 发布日期:2016-07-20
  • 通讯作者: 唐保祥 E-mail:tbx0618@sina.com

Counting Formulas of Perfect Matchings of Two Types of Graphs

TANG Baoxiang1, REN Han2   

  1. 1. School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741001, Gansu Province, China;2. Department of Mathematics, East China Normal University, Shanghai 200062, China
  • Received:2015-10-08 Online:2016-07-26 Published:2016-07-20
  • Contact: TANG Baoxiang E-mail:tbx0618@sina.com

摘要:

利用划分、 求和、 再递推的方法给出图2-nRO8和图2-F2n+1,4完美匹配数目的计算公式. 进一步, 用所给的方法可计算出许多图类的所有完美匹配的数目.

关键词: 完美匹配, 线性递推式, 特征方程, 通解

Abstract:

Using the method of partition, summation and rerecursion, we gave the counting formula of the perfect matching number for graphs 2-nRO8 and 2-F2n+1,4. Further, we used the method to calculate the number of all the perfect matching of many graph classes.

Key words: perfect matching, linear recursive formula, characteristic equation, general solution

中图分类号: 

  • O157.5