Journal of Jilin University Science Edition ›› 2020, Vol. 58 ›› Issue (4): 859-863.

Previous Articles     Next Articles

Perfect Matching Counts for 2-2nP5 and 2-nK1,1,1,3 Graphs

TANG Baoxiang1, REN Han2   

  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-12-09 Online:2020-07-26 Published:2020-07-16
  • Contact: TANG Baoxiang E-mail:tbx0618@sina.com

Abstract: The perfect matchings of  2-2nP5 and 2-nK1,1,1,3 graphs were classified according to the edges that matched a fixed vertex. First, we found out  the recurrence relations of each kind of  perfect matching number, and obtained a set of recurrence relations 
which were related to each other. Then we used the  correlation between these recurrence relations to give the  counting formula of the perfect matching mumber  of these two graphs.

Key words: perfect matching, classification, recurrence relation, counting formula

CLC Number: 

  • O157.5