Path Coverings with Prescribed Ends in Faulty Hypercubes

被引：4
|
作者：
Castaneda, Nelson [1 ]
Gotchev, Ivan S. [1 ]
机构：
[1] Cent Connecticut State Univ, Dept Math Sci, New Britain, CT 06050 USA
来源：
GRAPHS AND COMBINATORICS | 2015年 / 31卷 / 04期
关键词：
Hypercube; Path covering; Prescribed ends of a path; Hamiltonian path; Hamiltonian cycle; HAMILTONIAN CYCLES; EDGES;
D O I：
10.1007/s00373-014-1426-0
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We discuss the existence of vertex disjoint path coverings with prescribed ends for the -dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path coverings we establish the minimal integer such that for every such path coverings exist. Using some of these results, for , we prove Locke's conjecture that a hypercube with deleted vertices of each parity is Hamiltonian if Some of our lemmas substantially generalize known results of I. Havel and T. DvoA (TM) ak. At the end of the paper we formulate some conjectures supported by our results.
引用
收藏
页码：833 / 869
页数：37
相关论文
共 50 条
  • [1] Path Coverings with Prescribed Ends in Faulty Hypercubes
    Nelson Castañeda
    Ivan S. Gotchev
    Graphs and Combinatorics, 2015, 31 : 833 - 869
  • [2] Path embedding in faulty hypercubes
    Ma, Meijie
    Liu, Guizhen
    Pan, Xiangfeng
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 192 (01) : 233 - 238
  • [3] PARTITIONS OF FAULTY HYPERCUBES INTO PATHS WITH PRESCRIBED ENDVERTICES
    Dvorak, Tomas
    Gregor, Petr
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (04) : 1448 - 1461
  • [4] Hamiltonian path and cycle in hypercubes with faulty links
    Latifi, S
    Zheng, SQ
    Bagherzadeh, N
    FIFTH INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2002, : 471 - 478
  • [5] Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
    Wang, Fan
    Zhang, Heping
    DISCRETE MATHEMATICS, 2014, 321 : 35 - 44
  • [6] 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
  • [7] Paired many-to-many disjoint path covers in faulty hypercubes
    Jo, Shinhaeng
    Park, Jung-Heum
    Chwa, Kyung-Yong
    THEORETICAL COMPUTER SCIENCE, 2013, 513 : 1 - 24
  • [8] One-to-one disjoint path covers in hypercubes with faulty edges
    Wang, Fan
    Zhao, Weisheng
    JOURNAL OF SUPERCOMPUTING, 2019, 75 (08): : 5583 - 5595
  • [9] One-to-one disjoint path covers in hypercubes with faulty edges
    Fan Wang
    Weisheng Zhao
    The Journal of Supercomputing, 2019, 75 : 5583 - 5595
  • [10] BROADCASTING IN FAULTY HYPERCUBES
    WU, J
    FERNANDEZ, EB
    MICROPROCESSING AND MICROPROGRAMMING, 1993, 39 (01): : 43 - 53
12345