標題: A family of trivalent 1-hamiltonian graphs with diameter O(log n)
作者: Wang, JJ
Sung, TY
Hsu, LH
資訊工程學系
Department of Computer Science
關鍵字: hamiltonian;edge hamiltonian;1-vertex hamiltonian;I-edge hamiltonian;1-hamiltonian;diameter;Moore bound
公開日期: 1-Jul-2001
摘要: In this paper, we construct a family of graphs denoted by Eye(s) that are 3-regular, 3-connected, planar, hamiltonian, edge hamiltonian, and also minimal 1-hamiltonian. Furthermore, the diameter of Eye(s) is 0(log n), where n is the number of vertices in the Mph and to be precise, n = 6(2(s) - 1) vertices.
URI: http://hdl.handle.net/11536/29556
ISSN: 1016-2364
期刊: JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
Volume: 17
Issue: 4
起始頁: 535
結束頁: 548
Appears in Collections:Articles