Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6876304 | Theoretical Computer Science | 2013 | 5 Pages |
Abstract
A linear forest in a graph is a subgraph each component of which is a path. In this paper, we investigate the existence of a Hamiltonian cycle passing through a linear forest in a ternary n-cube Qn3 (nâ¥2) with faulty edges. Let F be a faulty edge set of Qn3 and L be a prescribed linear forest in Qn3âF. If |E(L)|â¤2nâ1 and |F|â¤nâ(â|E(L)|/2â+1), then there is a Hamiltonian cycle passing through L in Qn3âF.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yuxing Yang, Shiying Wang,