Journal of Jilin University Science Edition

Previous Articles     Next Articles

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

PDF (PC)

209

Like

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

CLC Number: 

  • O157.5
Copyright © Journal of Jilin University Science Edition, All Rights Reserved.
Tel: +86-431-88499428　E-mail: sejuj@jlu.edu.cn
Powered by Beijing Magtech Co. Ltd