多边形链图中的完美匹配数(英文)  

On the Number of Perfect Matchings in Polygonal Chains

作　　者：苏敏邦[1] 钱建国[2] 

机构地区：[1]佛山科学技术学院理工分院,广东佛山528231 [2]厦门大学数学系,福建厦门361005

出　　处：《数学研究》2000年第1期9-16,共8页Journal of Mathematical Study

摘　　要：多边形链图的完美匹配数 (即多边形碳氢链状聚合物的 Kekule结构数 )是数学化学研究的重要内容之一 .我们给出了一个求该数的简洁算法 ,并证明该数是一个多项式 .做为应用 ,对于一类特殊的多边形链图 ,给出了具体的表达式 .The linear fusions of hydrocarbons composed of polygonal rings is an important class of the fusions of hydrocarbons. In terms of graphic theory, such class can be represented as the ‘so called’ polygonal chains. An algorithm to count the number of perfect matchings in polygonal chains (i.e. Kekule structures in fusions) is obtained, which is very easy to calculate by hands (so by computers as well). As an application of this algorithm, we show that the number of perfect matchings in polygonal chains is a polynomial. A formula to count the perfect matchings in a class of polygonal chains is also derived.

关 键 词：多边形链图 完美匹配数 多边形碳氢链状聚合物 

分 类 号：O157[理学—数学]