Fault-free Hamiltonian cycles passing through a linear forest in ternary -cubes with faulty edges

详细信息    查看全文

• 作者：Yuxing Yang^a ; ^{yxyangcn@163.com} ; ^{yyx@henannu.edu.cn} ; Shiying Wang^a ; ^b ; ^{shiying@sxu.edu.cn}
• 关键词：Interconnection networks ; Fault tolerance ; kk-ary nn-cubes ; Hamiltonian cycles ; Linear forests
• 刊名：Theoretical Computer Science
• 出版年：2013
• 出版时间：17 June, 2013
• 年：2013
• 卷：491
• 期：Complete
• 页码：78-82
• 全文大小：220 K

文摘

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 -cube () with faulty edges. Let be a faulty edge set of and be a prescribed linear forest in . If and , then there is a Hamiltonian cycle passing through in .