扇面蜂巢图及其哈密顿图性质的研究.pdfVIP

扇面蜂巢图及其哈密顿图性质的研究 [1] [2] 宁安琪 宁宣熙 （南京航空航天大学经济与管理学院，南京，210016） [1]：ningangie@163.com [2]:nhning@nuaa, 摘要：本文提出了一种扇面蜂巢图，它是由若干个（P ≥2 ，P 为个数）20 角顶的哈密 顿图拼接成扇面构成的。文中研究了这种扇面蜂巢图的哈密顿图性质，给出了这一类图的标 准哈密顿圈的构造法，并利用在任意图中构造哈密顿圈的SOA 算法给出了一种典型扇面蜂 巢图的多个不同的哈密顿圈解。同时用P=1-50 （n=21--903 ）扇面蜂巢图中哈密顿圈的求解， 验证了SOA 算法的多项式时间性质 关键词：哈密顿圈，图论，多项式算法 Research on Fan-Shaped Honeycomb Graphs and Their Characterastic of Hamiltonian Graph Angelika Ning and Xuanxi Ning ( College of Economy Management, Nanjing University of Aeronautics and Astronautics, Nanjing 210016) Abstract: Fan-shaped honeycomb graphs are a kind of graphs which are made up of a number of the Hamiltonian dodecahedron graphs by connecting each other. It is shown that a standard Hamiltonian circuit can be constructed in these fan-shaped honeycomb graphs ,and proved that they are Hamiltonian graphs. In this paper the 15 different Hamiltonian circuits are constructed by using SOA algorithm for the fan-shaped honeycomb graph with P=6(P is the number of the Hamiltonian dodecahedrons). At last, the 50 fan-shaped honeycomb graphs (P=1—50，n=21—903) are designed to show the polynomial relationship between the operation time and the number of vertices. Keywords ：Hamiltonian Graph ，Graph Theory，Polynomial Algorithm 1，什么是扇面蜂巢图 在图论的发展史上，1850 年由数学家哈密顿提出的由20 个角顶构成的哈密顿图具有重 要意义（见图1）。现将其若干个以单边相连拼接成如图2 所 示的扇面，就成为本文中定义的扇面蜂巢图。其中每一个20 角顶的哈密顿图称为一页。 图1，20 角顶的哈密顿图 *国家自然科学基金资助项目。No 1