Recursive method for perfect matching number in two types of graphs
TANG Baoxiang1， REN Han2
1.School of Mathematics and Statistics Institute， Tianshui Normal University， Tianshui， Gansu 741001，China； 2.Department of Mathematics， East China Normal University， Shanghai 200062， China
Abstract：In this paper， for two types of special graphs 2-nP and 2-nC6,4， the recursive relation between two types of graph perfect matching numbers is established by using matching vertex classification method， and the recursive general solution is solved. An explicit formula for the perfect matching number of these two types of graphs is obtained.
唐保祥,任 韩. 两类图中完美匹配数的递推求法[J]. 华中师范大学学报(自然科学版), 2020, 54(1): 12-16.
TANG Baoxiang,REN Han. Recursive method for perfect matching number in two types of graphs. journal1, 2020, 54(1): 12-16.
2020, Vol. 54 
