吉林大学学报(理学版) ›› 2019, Vol. 57 ›› Issue (2): 285-290.

• 数学 • 上一篇    下一篇

按匹配顶点分类的完美匹配数递推求法

唐保祥1, 任韩2   

  1. 1. 天水师范学院 数学与统计学院, 甘肃 天水 741001; 2. 华东师范大学 数学科学学院, 上海 200062
  • 收稿日期:2018-09-17 出版日期:2019-03-26 发布日期:2019-03-26
  • 通讯作者: 唐保祥 E-mail:tbx0618@sina.com

Recursive Method for Perfect Matching Numbersby Matching Vertex Classification#br#

TANG Baoxiang1, REN Han2   

  1. 1. School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741001, Gansu Province, China;2. School of Mathematical Sciences, East China Normal University, Shanghai 200062, China
  • Received:2018-09-17 Online:2019-03-26 Published:2019-03-26
  • Contact: TANG Baoxiang E-mail:tbx0618@sina.com

摘要: 先把图2-nZ6,2-nXT3的完美匹配按匹配某个顶点进行分类, 求出一组相互联系的完美匹配数递推关系式, 再由这组递推关系式给出这两类图的完美匹配数计算公式.

关键词: 完美匹配, 分类, 递推式关系, 通解

Abstract: Firstly, the perfect matching of the graph 2-nZ6,2-nXT3 was classified by matching a certain vertex, and a recursive relation of a
 set of perfect matching numbers was obtained. Then the  formulas for calculating the perfect matching numbers of two types of graphs were given by these recursive relations.

Key words: perfect matching, classification, recursive relation, general solution

中图分类号: 

  • O157.5