Clar多面体的邻接性

The Adjacency of Clar Polyhedron

下载PDF

导出

摘要文献[1]中Hansen和Zheng把六角系统的Clar数计数问题转化为线性规划的最优解问题,文献[2]中Chvatal给出了两个匹配相邻的一个充要条件.受此启发,给出了六角系统的线性规划模型解向量的凸包构成的多面体(Clar多面体)上两个Clar覆盖相邻的充要条件和Clar多面体的维数. Hansen and Zheng formulated the Clar number problem for hexagonal system as an integer program. Chvatal gave the necessary and sufficient condition for two matching being adjacent. Motivated by this, we get a necessary and sufficient condition for the adjacency of two Clar coverings in the Clar polyhedron, which is the convex hull of the feasible solutions set of the integer programming model of the hexagonal system. Also, we obtain the dimension of a Clar polyhedron.

作者姜淑艳王洪伟李祚

机构地区西安建筑科技大学理学院临沂师范学院理学院

出处《临沂师范学院学报》 2010年第3期73-76,共4页 Journal of Linyi Teachers' College

关键词六角系统 Clar覆盖多面体 benzenoid system Clar cover polyhedron

分类号 O157.6 [理学—基础数学]

引文网络
相关文献

参考文献15

1Hansen P,Zheng M.The Clar and Fries problems for benzenoid hydrocarbon and linear programming[J].J Math chem,1994,15:93-107.
2Chvatal V.On certain polytopes associated with graphs[J].J Combinatorial Theory(B),1975,18:138-154.
3Balaban A T,Harary F.Enumeration and proposed nomenclature of benzenoid cata-condensed polycyclic aromatic hydrocarbons[J].Tetrabedron,1967,24:2505-2516.
4Dennis H Rouvray.Computational Chemical Graph Theory[M] //Balasubramanian K.Recent chemical applications of computational combinatorics and graph theory.New York:Nova Science,1990.
5Bonchev D,Rouvray D H.Chemical graph theory,introduction and fundamentals[M].New York:Gordon and Breach,1991.
6Bonchev D,Rouvray D H.Chemical graph theory,reactivity and kinetics[M].New York:Gordon and Breach,1992.
7Trinajstie N.Chemical graph theory[M].Boca Raton FL:CRC Press,1992.
8Rouvray D H.Computational chemical graph theory[M].New York:Nova Science,1990.
9Wang H,Ye D,Zhang H.The forcing number of toroidal polyhexes[J].J Math Chem,2008,43(2):457-475.
10Clar E.The aromatic sextet[M].New York:Wiley,1972.

临沂师范学院学报

2010年第3期

浏览历史

内容加载中请稍等...

Clar多面体的邻接性

参考文献15

相关作者

相关机构

相关主题

浏览历史