Clar多面体的邻接性  

The Adjacency of Clar Polyhedron

作　　者：姜淑艳[1] 王洪伟[2] 李祚[1] 

机构地区：[1]西安建筑科技大学理学院,陕西西安710055 [2]临沂师范学院理学院,山东临沂276005

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

摘　　要：文献[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.

关 键 词：六角系统 Clar覆盖 多面体 

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