3类图的完美对集数按匹配顶点分类的递推求法  

The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification

作　　者：唐保祥[1] 任韩[2] TANG Bao-xiang;REN Han(School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,China;Department of Mathematics,East China Normal University,Shanghai 200062,China)

机构地区：[1]天水师范学院数学与统计学院,甘肃天水741001 [2]华东师范大学数学系,上海200062

出　　处：《东北师大学报（自然科学版）》2019年第4期10-14,共5页Journal of Northeast Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目（11171114)

摘　　要：构造了三类新图2-2nN2,2-nX4和3-nD4,用递推的方法得到了图2-2nN2,2-nX4和3-nD4的完美对集数的三个递推关系式,再解出这三个递推式的通解,从而得到了这三类图的完美对集数的计算公式.Three new types of graphs 2-2nN2,2-nX4 and 3-nD4 are constructed.The three recursive relations of the perfect matching numbers of graphs 2-2nN2,2-nX4 and 3-nD4 are obtained by recursive method,and then the three recursive general solutions are solved.Thus,the formula for calculating the perfect matching number of these three types of graphs is obtained.

关 键 词：完美对集 分类 递推式关系 通解 

分 类 号：O157.5[理学—数学]