摘要
先把图2-nZ6,2-nXT3的完美匹配按匹配某个顶点进行分类,求出一组相互联系的完美匹配数递推关系式,再由这组递推关系式给出这两类图的完美匹配数计算公式.
Firstly,the perfect matching of the graph 2-nZ 6,2-nXT 3 was classified by matching a certain vertex,and a recursive relation of a set of perfect matching numbers was obtained.Then the formulas for calculating the perfect matching numbers of two types of graphs were given by these recursive relations.
作者
唐保祥
任韩
TANG Baoxiang;REN Han(School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,Gansu Province,China;School of Mathematical Sciences,East China Normal University,Shanghai 200062,China)
出处
《吉林大学学报（理学版）》
CAS
北大核心
2019年第2期285-290,共6页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:11171114)
关键词
完美匹配
分类
递推式关系
通解
perfect matching
classification
recursive relation
general solution
