Journal of Jilin University Science Edition ›› 2020, Vol. 58 ›› Issue (2): 309-313.

Previous Articles     Next Articles

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

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

CLC Number: 

  • O157.5