Hamiltonian cycles of balanced hypercube with more faulty edges

被引:2
|
作者
Lan, Ting [1 ]
Lu, Huazhong [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Math Sci, Chengdu 610054, Sichuan, Peoples R China
基金
中国国家自然科学基金;
关键词
Interconnection network; Balanced hypercubes; Hamiltonian cycle; Fault-tolerance; EXTRA CONNECTIVITY; LACEABILITY; PATHS;
D O I
10.1016/j.tcs.2023.113708
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The balanced hypercube BHn, a variant of the hypercube, is a novel interconnection network for massive parallel systems. It is known that the balanced hypercube remains Hamiltonian after deleting at most 4n - 5 faulty edges if each vertex is incident with at least two edges in the resulting graph for all n > 2. In this paper, we show that there still exists a Hamiltonian cycle in BHn for n > 2 after deleting a set F of edges with | F | <= 5n - 7 if the degree of every vertex in BHn - F is at least two and there exists no f4-cycles in BHn - F, which improves some known results.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:13
相关论文
共 50 条
  • [41] The Edge-fault Tolerant Hamiltonian of the Balanced Hypercube
    Cao, Jianxiang
    Shang, Wenqian
    Shi, Minyong
    2016 IEEE/ACIS 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2016, : 1129 - 1133
  • [42] Hamiltonian cycles and long cycles on the subgraph, of four consecutive levels, of the hypercube
    El-Hashash, M
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMPUTER SCIENCE II, 2002, : 188 - 198
  • [43] Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges
    Gu, Mei-Mei
    Hao, Rong-Xia
    Feng, Yan-Quan
    JOURNAL OF INTERCONNECTION NETWORKS, 2015, 15 (1-2)
  • [44] Hamiltonian paths passing through matchings in hypercubes with faulty edges
    Zhao, Shenyang
    Wang, Fan
    AIMS MATHEMATICS, 2024, 9 (12): : 33692 - 33711
  • [45] Hamiltonian Laceability of Hypercubes with Prescribed Linear Forest and/or Faulty Edges
    Yang, Yuxing
    Song, Ningning
    Zhao, Ziyue
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2024, 120 : 393 - 398
  • [46] Finding Hamiltonian cycles on incrementally extensible hypercube graphs
    Keh, HC
    Chou, PY
    Lin, JC
    HIGH PERFORMANCE COMPUTING ON THE INFORMATION SUPERHIGHWAY - HPC ASIA '97, PROCEEDINGS, 1997, : 361 - 366
  • [47] Embedding hamiltonian cycles into folded hypercubes with faulty links
    Wang, DJ
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (04) : 545 - 564
  • [48] On the existence of hamiltonian cycles after removing edges
    Li, Hao
    Ning, Wantao
    Cai, Junqing
    UTILITAS MATHEMATICA, 2015, 97 : 329 - 353
  • [49] Hamiltonian cycles avoiding sets of edges in a graph
    Ferrara, Michael J.
    Jacobson, Michael S.
    Harlan, Angela K.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 48 : 191 - 203
  • [50] Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
    Yang, Yuxing
    Wang, Shiying
    THEORETICAL COMPUTER SCIENCE, 2013, 491 : 78 - 82