Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position

It is proved that there exists a path P"l(x,y) of length l if d"A"Q"""n(x,y)@?l@?2^n-1 between any two distinct vertices x and y of AQ"n. Obviously, we expect that such a 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 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 for any three distinct vertices x, y, and z of AQ"n with n>=2 and for any d"A"Q"""n(x,y)@?l@?2^n-1-d"A"Q"""n(y,z). Furthermore, there exists a hamiltonian cycle S(x,y;l) such that d"S"("x","y";"l")(x,y)=l for any two distinct vertices x and y and for any d"A"Q"""n(x,y)@?l@?2^n^-^1.

[1]  Jun-Ming Xu,et al.  Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes , 2007, Parallel Comput..

[2]  Jimmy J. M. Tan,et al.  Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes , 2003, Inf. Process. Lett..

[3]  Jimmy J. M. Tan,et al.  Fault hamiltonicity of augmented cubes , 2005, Parallel Comput..

[4]  Xiaohua Jia,et al.  Optimal Embeddings of Paths with Various Lengths in Twisted Cubes , 2007, IEEE Transactions on Parallel and Distributed Systems.

[5]  Khaled Day,et al.  Embedding of Cycles in Arrangement Graphs , 1993, IEEE Trans. Computers.

[6]  Pao-Lien Lai,et al.  Geodesic pancyclicity and balanced pancyclicity of Augmented cubes , 2007, Inf. Process. Lett..

[7]  Gen-Huey Chen,et al.  Cycles in butterfly graphs , 2000, Networks.

[8]  Sheshayya A. Choudum,et al.  Augmented cubes , 2002, Networks.

[9]  Xiaohua Jia,et al.  Complete path embeddings in crossed cubes , 2006, Inf. Sci..

[10]  Jun-Ming Xu,et al.  The forwarding indices of augmented cubes , 2007, Inf. Process. Lett..

[11]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[12]  Jun-Ming Xu,et al.  Panconnectivity of locally twisted cubes , 2006, Appl. Math. Lett..

[13]  Jou-Ming Chang,et al.  Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs , 2004, Networks.

[14]  Anne Germa,et al.  Cycles in the cube-connected cycles graph , 1998, Discret. Appl. Math..

[15]  Xiaohua Jia,et al.  Optimal path embedding in crossed cubes , 2005, IEEE Transactions on Parallel and Distributed Systems.

[16]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[17]  Frank Thomson Leighton Introduction to parallel algorithms and architectures: arrays , 1992 .

[18]  Jou-Ming Chang,et al.  Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs , 2004 .