Affiliation:
1. School of Mathematics and Information Science, Henan Normal University , Xinxiang, Henan 453007, PR China
Abstract
Abstract
Let $H$ be a cartesian product graph of even cycles and paths, where the first multiplier is an even cycle of length at least $4$ and the second multiplier is a path with at least two nodes or an even cycle. Then $H$ is an equitable bipartite graph, which takes the torus, the column-torus and the even $k$-ary $n$-cube as its special cases. For any node $w$ of $H$ and any two different nodes $u$ and $v$ in the partite set of $H$ not containing $w$, an algorithm was introduced to construct a hamiltonian path connecting $u$ and $v$ in $H-w$.
Publisher
Oxford University Press (OUP)
Reference32 articles.
1. Survey on path and cycle embedding in some networks;Xu;Front. Math. China,2009
2. Lee distance and topological properties of k-ary n-cubes;Bose;IEEE Trans. Comput.,1995
3. Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes;Yang;J. Parallel Distrib. Comput.,2007
4. Embedding long paths in k-ary n-cubes with faulty nodes and links;Stewart;IEEE Trans. Parallel. Distrib. Syst.,2008
5. Hamiltonian cycle and path embeddings in k-ary n-cubes based on structure faults;Lv;Comput. J.,2017