|
|||||
|
|
| ON THE CONSTRUCTION AND ENUMERATION OF HAMILTONIAN GRAPHS | |
| 引用本文： | 胡冠章 李岷珊. ON THE CONSTRUCTION AND ENUMERATION OF HAMILTONIAN GRAPHS[J]. 高校应用数学学报(英文版), 1993, 8(1): 25-31. DOI: 10.1007/BF02661988 |
| 作者姓名： | 胡冠章 李岷珊 |
| 作者单位： | DepartmentofAppliedMathematics,TsinghuaUniversity,Beijing100084 |
| 摘 要： | In this paer we give a farmula for enumerating the equivalent classes of orderly labeled Hamiltonian graphs under group D.and two algorithms for constructing these equivalent classes and all nonisomorphic Hamiltonian graphs.Some computational results obtained by microcomputers are listed. |
| 关 键 词： | 汉密尔顿图 运算法则 图论 计数公式 |
| 收稿时间： | 1991-11-02 |
On the construction and enumeration of Hamiltonian graphs |
|
| Hu Guanzhang,Li Minshan. On the construction and enumeration of Hamiltonian graphs[J]. Applied Mathematics A Journal of Chinese Universities, 1993, 8(1): 25-31. DOI: 10.1007/BF02661988 | |
| Authors: | Hu Guanzhang Li Minshan |
| Affiliation: | (1) Department of Applied Mathematics, Tsinghua University, 100084 Beijing |
| Abstract: | In this paper we give a formula for enumerating the equivalent classes of orderly labeled Hamiltonian graphs under group D. and two algorithms for constructing these equivalent classes and all nonisomorphic Hamiltonian graphs. Some computational results obtained by microcomputers are listed. |
| Keywords: | Hamiltonian Graph Formula for Enumerating Algorithm. |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ | |