On the Enhanced Hyper-hamiltonian Laceability of Hypercubes
檔案
本條目沒有附加檔案。
日期
2009
類型
系所
期刊名稱
CEA'09: PROCEEDINGS OF THE 3RD WSEAS INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATIONS
卷期與頁次
頁 62–67
ISBN
978-960-474-041-3
語言
英文
摘要
A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any two vertices that are in different partite sets. A hamiltonian laceable graph G is said to be hyper-hamiltonian laceable if, for any vertex v of G, there exists a hamiltonian path of G - {v} joining any two vertices that are located in the same partite set different from that of v. In this paper, we further improve the hyper-hamiltonian laceability of hypercubes by showing that, for any two vertices x, y from one partite set of Q(n), n >= 4, and any vertex w from the other partite set, there exists a hamiltonian path H of Q(n) - {w} joining x to y such that d(H)(X, Z) = l for any vertex z is an element of V(Q(n)) - {x, y, w} and for every integer l satisfying both d(Qn) (x, z) <= l <= 2(n) - 2 - d(Qn) (z, y) and 2 vertical bar(l - d(Qn) (x, z)). As a consequence, many attractive properties of hypercubes follow directly from our result.
所屬典藏
會議論文引用此條目
Tsai, T.-H., Kung, T.-L., Tan, J. J. M., & Hsu, L.-H. (2009). On the Enhanced Hyper-hamiltonian Laceability of Hypercubes. CEA'09: PROCEEDINGS OF THE 3RD WSEAS INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATIONS, 62–67. https://ir.lib.nycu.edu.tw/handle/11536/16160
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/16160