The number of perfect matchings in a class of random Polygonal chains

 报告题目:The number of perfect matchings in a class of random Polygonal chains

 报  告  人:魏首柳    副教授

 报告时间:2017年10月27日(星期四)下午15:10

 报告地点:第三办公区202室


 报告摘要:

A perfect matching of a graph G is a set of independent edges in E(G) covering every vertex exactly once. Enumeration of perfect matchings of a graph is interesting in chemistry, physics and mathematics. But the enumeration problem for perfect matchings in general graphs (even in bipartite graphs) is NP-hard. In this paper, we give a simple counting formula for the expected value of the number of perfect matchings in random polygonal chains and obtain the average number of perfect matchings of the set of all polygonal chains with n polygons.


 报告人介绍:

魏首柳,现任闽江学院副教授,主要从事图论中的匹配计数理论和化学拓扑不变量的研究。已在J. Math. Chem.及MATCH. Commun. Math. Compt. Chem.等国内外期刊上发表论文20余篇。