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

被引：18

作者：

Wang, Shiying ^{[1
]}

Zhang, Shurong ^{[1
]}

机构：

[1] Shanxi Univ, Sch Math Sci, Taiyuan 030006, Shanxi, Peoples R China

来源：

THEORETICAL COMPUTER SCIENCE | 2011年 / 412卷 / 46期

基金：

中国国家自然科学基金;

关键词：

Path embeddings; Hamiltonian paths; Conditional edge faults; k-ary n-cubes; LINEAR-ARRAY; BIPANCYCLICITY; HYPERCUBES; NODES;

D O I：

10.1016/j.tcs.2011.02.030

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：6570 / 6584

页数：15

共 50 条

[1] Embedding various cycles with prescribed paths into k-ary n-cubes
Yang, Yuxing
Li, Jing
Wang, Shiying
[J]. DISCRETE APPLIED MATHEMATICS, 2017, 220 : 161 - 169
[2] Embedding Hamiltonian Paths in k-Ary n-Cubes With Exponentially-Many Faulty Edges
Zhuang, Hongbin
Li, Xiao-Yan
Chang, Jou-Ming
Lin, Cheng-Kuan
Liu, Ximeng
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2023, 72 (11) : 3245 - 3258
[3] Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Wang, Shiying
Zhang, Shurong
Yang, Yuxing
[J]. INFORMATION SCIENCES, 2014, 268 : 463 - 488
[4] Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
Bae, MM
Bose, B
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2003, 52 (10) : 1271 - 1284
[5] Embedding long paths in k-ary n-cubes with faulty nodes and links
Stewart, Iain A.
Xiang, Yonghong
[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (08) : 1071 - 1085
[6] Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes*
Wang, Shiying
Zhang, Shurong
[J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2019, 53 (3-4): : 85 - 113
[7] The Edge Connectivity of Expanded k-Ary n-Cubes
Wang, Shiying
Wang, Mujiangshan
[J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2018, 2018
[8] Embedded edge connectivity of k-ary n-cubes
Yang, Yuxing
[J]. INFORMATION PROCESSING LETTERS, 2023, 180
[9] Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults
Lv, Yali
Lin, Cheng-Kuan
Fan, Jianxi
[J]. COMPUTER JOURNAL, 2017, 60 (02): : 159 - 179
[10] An Efficient Algorithm for Hamiltonian Path Embedding of k-Ary n-Cubes Under the Partitioned Edge Fault Model
Zhuang, Hongbin
Li, Xiao-Yan
Chang, Jou-Ming
Wang, Dajin
[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2023, 34 (06) : 1802 - 1815

← 1 2 3 4 5 →