欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
图的完美对集计数问题已经被证实是NP—难问题,因此要得到一般图的完美对集的数目是非常困难的。该问题在蛋白质结构预测、晶体物理学、计算机科学和量子化学中都有重要的应用,对此问题的研究具有非常重要的理论价值和现实意义。用划分,求和,再递推的方法分别给出了图3-n T4,5-n T6和2-2n Q2×2的完美匹配数目的计算公式,为图的完美匹配问题的应用提供了理论支持。
英文摘要：
Perfect matching counting problems graph has been proven to be NP-hard. To get the number of perfectly matched general graph is very difficult. The issue has important applications in protein struc- ture prediction, crystal physics, very important theoretical and quantum chemistry and computer science. The research on this issue has practical significance. The counting formula of the perfect matching for graphs 3 -nT4, 5 -nT6and 2 -2nQ2 ×2 are obtained by applying differentiation, summation and re-recur- sion . This provides the theory support for the application of perfect matching in graph.
同期刊论文项目
同项目期刊论文
期刊信息
位置：