欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
匹配计数理论是图论的核心内容之一,由于得到应用领域的支持,并与其他理论课题发生密切联系,受到众多学者的关注,产生出许多含义丰富而深刻的理论成果。但是,一般图的完美匹配计数问题却是NP-困难的。用划分、求和、再递推的方法给出了5类图完美匹配数目的显式表达式。所给出的方法,可以计算出许多二分图的所有完美匹配的数目。
英文摘要：
Matching counting theory is the core of graph theory. Since it has important applications and is in connection with other theoretic problems closely, it has been studied extensively. And many cele-brated results have been established. But the problem of counting the number of perfect matchings for general graphs is NP - hard. By applying differentiation, summation and re-recursion calculation, several counting formulas of the perfect matchings for five specific types of graphs are given. The number of all perfect matchings of many bipartite graphs can be calculated with this method.
同期刊论文项目
同项目期刊论文
期刊信息
位置：