Fault-tolerant hamiltonian laceability of hypercubes

被引：89
|
作者：
Tsai, CH [1 ]
Tan, JJM [1 ]
Liang, TN [1 ]
Hsu, LH [1 ]
机构：
[1] Natl Chiao Tung Univ, Dept Comp & Informat Sci, Hsinchu 30050, Taiwan
来源：
INFORMATION PROCESSING LETTERS | 2002年 / 83卷 / 06期
关键词：
hamiltonian laceable; hypercube; fault tolerance;
D O I：
10.1016/S0020-0190(02)00214-4
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
It is known that every hypercube Q(n) is a bipartite graph. Assume that n greater than or equal to 2 and F is a subset of edges with \F\ less than or equal to n - 2. We prove that there exists a hamiltonian path in Q(n) - F between any two vertices of different partite sets. Moreover, there exists a path of length 2(n) - 2 between any two vertices of the same partite set. Assume that n greater than or equal to 3 and F is a subset of edges with \F\ less than or equal to n - 3. We prove that there exists a hamiltonian path in Q(n) - {v} - F between any two vertices in the partite set without v. Furthermore, all bounds are tight. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：301 / 306
页数：6
相关论文
共 50 条
  • [1] Fault-tolerant Hamiltonian laceability of balanced hypercubes
    Zhou, Qingguo
    Chen, Dan
    Lu, Huazhong
    [J]. INFORMATION SCIENCES, 2015, 300 : 20 - 27
  • [2] Edge Fault-Tolerant Strong Hamiltonian Laceability of Balanced Hypercubes
    Gu, Mei-Mei
    Hao, Rong-Xia
    Feng, Yan-Quan
    [J]. JOURNAL OF INTERCONNECTION NETWORKS, 2016, 16 (02)
  • [3] Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes
    Yang, Yuxing
    Li, Jing
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 888 : 108 - 116
  • [4] Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes
    Yang, Yuxing
    Zhang, Lingling
    [J]. INFORMATION PROCESSING LETTERS, 2019, 145 : 11 - 15
  • [5] FAULT-TOLERANT HAMILTONIAN LACEABILITY AND FAULT-TOLERANT CONDITIONAL HAMILTONIAN FOR BIPARTITE HYPERCUBE-LIKE NETWORKS
    Lin, Cheng-Kuan
    Ho, Tung-Yang
    Tan, Jimmy J. M.
    Hsu, Lih-Hsing
    [J]. JOURNAL OF INTERCONNECTION NETWORKS, 2009, 10 (03) : 243 - 251
  • [6] Fault-Tolerant Strongly Hamiltonian Laceability and Hyper-Hamiltonian Laceability of Cayley Graphs Generated by Transposition Trees
    Xue, Shudan
    Deng, Qingying
    Li, Pingshan
    [J]. COMPUTER JOURNAL, 2023, 66 (02): : 384 - 398
  • [7] Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
    Li, Hengzhe
    Yang, Weihua
    Meng, Jixiang
    [J]. DISCRETE MATHEMATICS, 2012, 312 (21) : 3087 - 3095
  • [8] Fault-tolerant mutually independent Hamiltonian cycles embedding on hypercubes
    Hsieh, Sun-Yuan
    [J]. ICICIC 2006: FIRST INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING, INFORMATION AND CONTROL, VOL 2, PROCEEDINGS, 2006, : 288 - 291
  • [9] FAULT-TOLERANT MULTICASTING ON HYPERCUBES
    LIANG, AC
    BHATTACHARYA, S
    TSAI, WT
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 23 (03) : 418 - 428
  • [10] Hamiltonian laceability in hypercubes with faulty edges
    Wang, Fan
    Zhang, Heping
    [J]. DISCRETE APPLIED MATHEMATICS, 2018, 236 : 438 - 445
12345