吉林大学学报(理学版) ›› 2020, Vol. 58 ›› Issue (2): 309-313.

• 数学 • 上一篇    下一篇

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

唐保祥1, 任韩2   

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

Perfect Matching Number of Two Kinds of Graphs  Based onRecursive Method of Matching  Vertex Classification

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:2019-04-15 Online:2020-03-26 Published:2020-03-25
  • Contact: TANG Baoxiang E-mail:tbx0618@sina.com

摘要: 先把图3-nY4和3-nC6,3的完美匹配按饱和某个顶点的完美匹配进行分类, 得到一组有相互联系的递推关系式, 再由这组递推式间的关系给出这两类图完美匹配数的计算公式.

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

Abstract: First, the perfect matching of graphs 3-nY4 and 3-nC6,3 was classified according to the perfect matching of a certain vertex, we obtained  a set of recursive formulas which were related to  each other. Then,  the formula for calculating the perfect matching number of these two kinds of graphs was derived from the relationship between the recursive formulas.

Key words: perfect matching, classification, recursive relationship, general solution

中图分类号: 

  • O157.5