摘要
把图2-2nP5和2-2nP5的完美匹配按匹配一个固定顶点的边进行分类,先求出每类完美匹配数目的递推关系式,得到一组有相互联系的递推关系式,再利用这组递推式之间的相互关系,给出这两个图完美匹配数的计数公式.
The perfect matchings of 2-2 nP 5 and 2-nK 1,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.
作者
唐保祥
任韩
TANG Baoxiang;REN Han(School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,Gansu Province,China;Department of Mathematics,East China Normal University,Shanghai 200062,China)
出处
《吉林大学学报（理学版）》
CAS
北大核心
2020年第4期859-863,共5页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:11171114).
关键词
完美匹配
分类
递推式关系
计数公式
perfect matching
classification
recurrence relation
counting formula
