[1]唐保祥,任 韩.2类特殊图的完美对集数的分类递推求法[J].南京师大学报(自然科学版),2021,44(01):1-5.[doi:10.3969/j.issn.1001-4616.2021.01.001]
　Tang Baoxiang,Ren Han.Classification and Recursive Method for Perfect MatchingNumber of Two Kinds of Special Graphsc[J].Journal of Nanjing Normal University(Natural Science Edition),2021,44(01):1-5.[doi:10.3969/j.issn.1001-4616.2021.01.001]
点击复制

2类特殊图的完美对集数的分类递推求法()
分享到：

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

卷:
第44卷
期数:
2021年01期
页码:
1-5
栏目:
·数学·
出版日期:
2021-03-15

文章信息/Info

Title:
Classification and Recursive Method for Perfect MatchingNumber of Two Kinds of Special Graphsc
文章编号:
1001-4616(2021)01-0001-05
作者:
唐保祥1; 任 韩2
(1.天水师范学院数学与统计学院,甘肃 天水 741001)(2.华东师范大学数学系,上海 200062)
Author(s):
Tang Baoxiang1; Ren Han2
(1.School of Mathematics and Statistics Institute,Tianshui Normal University,Tianshui 741001,China)2.Department of Mathematics,East China Normal University,Shanghai 200062,China)
关键词:
完美对集; 递推式关系; 通解
Keywords:
perfect matching; recurrence formula; general solution
分类号:
O157.5
DOI:
10.3969/j.issn.1001-4616.2021.01.001
文献标志码:
A
摘要:
用划分、求和的方法分别给出了图2-nP8和2-nZ3的完美对集数目的递推关系式,再从得到的递推关系式中求出了这两类图的完美对集数目的显式计算公式. 本文给出了求一些图的完美对集数的一种方法,为完美对集理论的应用提供了支持.
Abstract:
The recursive relation between the perfect matching numbers of graphs 2-nP8 and 2-nZ3 is given by the method of division and summation,and the explicit formula for the perfect matching number of these two graphs is obtained from the recursive relation obtained. This paper gives a method for finding the perfect matching number of some graphs,which provides support for the application of perfect matching theory.

参考文献/References:

[1] LOVáSZ L,PLUMMER M D. Matching theory[M]. New York:North-Holland Press,1986.
[2]ZHANG H P,ZHANG F J. Perfect matchings of polyomino graphs[J]. Graphs and combinatorics,1997,13:259-304.
[3]LI S L,YAN W G. The matching energy of graphs with given parameters[J]. Discrete applied mathematics,2014,162:415-420.
[4]DONG F M,YAN W G,ZHANG F J. On the number of perfect matchings of line graphs[J]. Discrete applied mathematics,2013,161:794-801.
[5]YAN W G,ZHANG F J. A quadratic identity for the number of perfect matchings of plane graphs[J]. Theoretical computer science,2008,409:405-410.
[6]CHANG A,SHIU W C. On the kth eigenvalues of trees with perfect matchings[J]. Discrete mathematics and theoretical computer science,2007,9(1):321-332.
[7]林泓,林晓霞. 若干四角系统完美匹配数的计算[J]. 福州大学学报(自然科学版),2005,33(6):704-710.
[8]唐保祥,任韩. 3类特殊图完美对集数的计算[J]. 南开大学学报(自然科学版),2014,47(5):11-16.
[9]唐保祥,任韩. 4类图完美匹配的计数[J]. 武汉大学学报(理学版),2012,58(5):441-446.
[10]唐保祥,任韩. 两类图完美匹配的计数公式[J]. 吉林大学学报(理学版),2016,54(4):790-792.
[11]唐保祥,任韩. 2类图完美匹配数目的解析式[J]. 中山大学学报(自然科学版),2016,55(4):15-17.
[12]唐保祥,任韩. 2类特殊图中的完美匹配数[J]. 浙江大学学报(理学版),2017,44(3):266-269.
[13]唐保祥,任韩. 4类图完美匹配数目的递推求法[J]. 数学杂志,2015,353(2):626-634.
[14]唐保祥,任韩. 3类图完美匹配数目的计算公式[J]. 南京师大学报(自然科学版),2016,39(4):1-4.

相似文献/References:

[1]唐保祥,任　韩.3类3-正则图中的完美对集数[J].南京师大学报(自然科学版),2016,39(01):21.
　Tang Baoxiang,Ren Han.The Number of Perfect Matchings in Two Types of 3-Regular Graph[J].Journal of Nanjing Normal University(Natural Science Edition),2016,39(01):21.
[2]唐保祥,任 韩.2类图的完美匹配数的分类递推求法[J].南京师大学报(自然科学版),2019,42(01):1.[doi:10.3969/j.issn.1001-4616.2019.01.001]
　Tang Baoxiang,Ren Han.Classification and Push Solution Method for the Number ofPerfect Matchings of Two Types Graphs[J].Journal of Nanjing Normal University(Natural Science Edition),2019,42(01):1.[doi:10.3969/j.issn.1001-4616.2019.01.001]

备注/Memo

备注/Memo:
收稿日期:2020-05-17.
基金项目:国家自然科学基金项目(11171114).
通讯作者:唐保祥,教授,研究方向:图论和组合数学研究. E-mail:tbx0618@sina.com
更新日期/Last Update: 2021-03-15