| 顶点的度与Hamilton圈算法 |
| |
| 引用本文： | 陈婵.顶点的度与Hamilton圈算法[J].杭州师范学院学报(社会科学版),1993(6). |
| |
| 作者姓名： | 陈婵 |
| |
| 作者单位： | 杭州师范学院数学系 |
| |
| 摘 要： | 单图可按顶点的度构作Hamilton圈,本文给出Hamilton圈的一个算法.
|
| 关 键 词： | Hamilton圈 算法 |
THE DEGREE OF THEVERTEX AND THE ALOGRITHM OF HAMILTON CIRCUITS |
| |
| Chen Chan.THE DEGREE OF THEVERTEX AND THE ALOGRITHM OF HAMILTON CIRCUITS[J].Journal of Hangzhou Teachers College(Humanities and Social Sciences),1993(6). |
| |
| Authors: | Chen Chan |
| |
| Institution: | Department of Mathematics |
| |
| Abstract: | Simple graph can be made into Hamilton circuits according to the degree of the vertex. On this basis, this paper gives an alogrithm of Hamilton circuits. |
| |
| Keywords: | Hamilton circuits alogrithm |
| 本文献已被 CNKI 等数据库收录！ |
