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

Authors:
Chung-Meng Lee;Yuan-Hsiang Teng;Jimmy J. M. Tan;Lih-Hsing Hsu
Affiliations:
Department of Computer Science and Information Engineering, Providence University, Taichung County, 433, Taiwan, ROC;Department of Computer Science and Information Engineering, Hungkuang University, Taichung County, 433, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu City, 300, Taiwan, ROC;Department of Computer Science and Information Engineering, Providence University, Taichung County, 433, Taiwan, ROC
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 13
Cited 3

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Cycles in the cube-connected cycles graph

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Embedding of Cycles in Arrangement Graphs

IEEE Transactions on Computers
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes

Information Processing Letters
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

Networks
Fault hamiltonicity of augmented cubes

Parallel Computing
Graph Theory With Applications

Graph Theory With Applications
Optimal Path Embedding in Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
The forwarding indices of augmented cubes

Information Processing Letters
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes

Information Processing Letters
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes

Parallel Computing
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes

IEEE Transactions on Parallel and Distributed Systems
Complete path embeddings in crossed cubes

Information Sciences: an International Journal

The panpositionable panconnectedness of augmented cubes

Information Sciences: an International Journal
Two spanning disjoint paths with required length in generalized hypercubes

Theoretical Computer Science
Conditional edge-fault pancyclicity of augmented cubes

Theoretical Computer Science

Quantified Score

Hi-index	0.09

Visualization

Abstract

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.