数学与计算机科学 |
|
|
|
|
图的1-因子数目的递推求法 |
唐保祥1, 任韩2 |
1.天水师范学院 数学与统计学院, 甘肃 天水 741001 2.华东师范大学 数学系, 上海 200062 |
|
Recursive method for the number of 1-factors in graphs |
TANG Baoxiang1, REN Han2 |
1.School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741001, Gansu Province,China 2.Department of Mathematics, East China Normal University, Shanghai 200062 , China |
1VALIANT L G. The complexity of computing the permanent[J]. Theoretical Compute Science, 1979, 8(2):189-201. DOI:10.1016/0304-3975(79)90044-6 2林泓,林晓霞.若干四角系统完美匹配数的计算[J]. 福州大学学报(自然科学版), 2005, 33(6):704-710,735.DOI:10.3969/j.issn.1000-2243.2005.06.003LIN H, LIN X X. Enumeration of perfect matchings in some type polyminoes[J]. Journal of Fuzhou University(Natural Sciences Edition), 2005, 33(6):704-710,735 .DOI:10.3969/j.issn.1000-2243.2005.06.003 3唐保祥,李刚,任韩. 3类图完美匹配的数目[J]. 浙江大学学报(理学版), 2011, 38(4):16-19.DOI:10.3785/j.issn.1008-9497.2011.04.005TANG B X, LI G, REN H. The number of perfect matching for three specific types of graphs[J]. Journal of Zhejiang University(Science Edition), 2011, 38(4):16-19 .DOI:10.3785/j.issn.1008-9497.2011.04.005 4唐保祥,任韩. 4 类图完美匹配数目的递推求法[J]. 数学杂志, 2015, 35(3):626-634.TANG B X, REN H. Recursive method for finding the number of perfect matchings of the four types of graphs[J]. Journal of Mathematics, 2015, 35(3):626-634 . 5唐保祥,任韩. 3类特殊图完美对集数的计算[J]. 南开大学学报(自然科学版), 2014, 47(5):11-16.TANG B X, REN H. The enumeration of perfect matchings in three types of special graphs[J]. Acta Scientiarum Universitatis Nankaiensis, 2014, 47(5):11-16. 6唐保祥,任韩. 4类图完美匹配的计数[J]. 武汉大学学报(理学版), 2012, 58(5):441-446.TANG B X, REN H. The number of perfect matchings for four types of graphs[J]. Journal of Wuhan University (Natural Science Edition), 2012, 58(5):441-446. 7唐保祥,任韩. 两类图完美匹配的计数公式[J]. 吉林大学学报(理学版), 2016,54(4): 790-792 .DOI:10.13413/j.cnki.jdxblxb.2016.04.20TANG B X, REN H. Counting formulas of perfect matchings of two types of graphs[J]. Journal of Jilin University( Science Edition), 2016, 54(4): 790-792. 8唐保祥,任韩. 2类图完美匹配数目的解析式[J]. 中山大学学报(自然科学版), 2016, 55(4):15-17.TANG B X, REN H. The analytic formula of the number of perfect matchings of two types of graphs[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2016, 55(4):15-17. 9唐保祥,任韩. 2类特殊图中的完美匹配数[J]. 浙江大学学报(理学版), 2017, 44(3):266-269.DOI:10.3785/j.issn.1008-9497.2017.03.003TANG B X, REN H. The number of perfect matchings in two types of particular graphs[J]. Journal of Zhejiang University(Science Edition), 2017, 44(3):266-269.DOI:10.3785/j.issn.1008-9497.2017.03.003 10唐保祥,任韩. 2类偶图完美匹配的数目[J]. 西南大学学报(自然科学版), 2012, 34(10):91-95.TANG B X, REN H. The number of perfect matching for two types of bipartite graphs[J]. Journal of Southwest University(Natural Science Edition), 2012, 34(10):91-95. 11唐保祥,任韩.几类图完美匹配的数目[J]. 南京师范大学学报(自然科学版),2010,33(3):1-6.DOI:10.3969/j.issn.1001-4616.2010.03.001TANG B X, REN H. The number of perfect matching in several types of graphs[J]. Journal of Nanjing Normal University (Natural Science Edition), 2010, 33(3):1-6. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|