NEIGHBORHOOD UNIONS AT DISTANCE TWO AND HAMILTONICITY OF GRAPHS

被引：0

作者：

刘新

张莲珠

朱永津

机构：

[1] Institute of Systems Science

[2] Academia Sinica

[3] Beijing

[4] PRC

[5] Department of Mathematics

[6] Zhangzhou Normal College

[7] Fujian

来源：

ChineseScienceBulletin | 1992年 / 18期

关键词：

UK; UT; NEIGHBORHOOD UNIONS AT DISTANCE TWO AND HAMILTONICITY OF GRAPHS;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

<正> Let G=(V, E) be an undirected graph of order n. If G has a Hamiltonian cycle (a cycle containing every vertex of G), then G is called Hamiltonian. Define

引用

页码：1582 / 1582

页数：1