標題: | Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position |
作者: | Lee, Chung-Meng Tan, Jimmy J. M. Hsu, Lih-Hsing 資訊工程學系 Department of Computer Science |
關鍵字: | interconnection networks |
公開日期: | 16-Aug-2008 |
摘要: | Assume that n is a positive integer with n >= 2. It is proved that between any two different vertices x and y of Q(n) there exists a path PI(x, y) of length l for any l with h(x, y) <= l <= 2(n) - 1 and 2 vertical bar(l - h(x, y)). We expect such path P-l(x, y) can be further extended by including the vertices not in P-l(x, y) into a hamiltonian path from x to a fixed vertex z or a hamiltonian cycle. In this paper, we prove that for any two vertices x and z from different partite set of n-dimensional hypercube Q(n), for any vertex y is an element of V(Q(n)) - {x, z}, and for any integer I with h(x, y) <= l <= 2(n) - l - h(y, z) and 2 vertical bar(l - h(x, y)), there exists a hamiltonian path R(x, y, z; l) from x to z such that d(R(x,y,z,l))(x, y) = l. Moreover, for any two distinct vertices x and y of Q,, and for any integer I with h(x, y) <= l <= 2(n-1) and 2 vertical bar(l - h(x, y)), there exists a hamiltonian cycle S(x, y; l) such that d(S(X,y;l))(x, y) = l. (C) 2008 Elsevier B.V. All rights reserved. |
URI: | http://dx.doi.org/10.1016/j.ipl.2008.02.013 http://hdl.handle.net/11536/8461 |
ISSN: | 0020-0190 |
DOI: | 10.1016/j.ipl.2008.02.013 |
期刊: | INFORMATION PROCESSING LETTERS |
Volume: | 107 |
Issue: | 5 |
起始頁: | 171 |
結束頁: | 176 |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.