Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults

作者：Wang Shiying^*; Zhang Shurong

来源：Theoretical Computer Science, 2011, 412(46): 6570-6584.

DOI：10.1016/j.tcs.2011.02.030

• Path embeddings
• Hamiltonian paths
• Conditional edge faults
• k-ary n-cubes

It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. In this paper, we consider the faulty k-ary n-cube with even k >= 4 and n >= 2 such that each vertex of the k-ary n-cube is incident with at least two healthy edges. Based on this requirement, we prove that the k-ary n-cube contains a hamiltonian path joining every pair of vertices which are in different parts, even if it has up to 4n - 6 edge faults.

• 出版日期2011-10-28
• 单位山西大学