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
关键词
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 条
  • [31] Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges
    Gu, Mei-Mei
    Hao, Rong-Xia
    ARS COMBINATORIA, 2018, 140 : 45 - 61
  • [32] Hamiltonicity of hypercubes with a constraint of required and faulty edges
    Lih-Hsing Hsu
    Shu-Chung Liu
    Yeong-Nan Yeh
    Journal of Combinatorial Optimization, 2007, 14 : 197 - 204
  • [33] On some global operations in faulty SIMD hypercubes
    Sengupta, A
    Raghavendra, CS
    10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 579 - 583
  • [34] Long cycles in hypercubes with distant faulty vertices
    Gregor, Petr
    Skrekovski, Riste
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2009, 11 (01): : 185 - 198
  • [35] On the mutually independent Hamiltonian cycles in faulty hypercubes
    Vukasinovic, Vida
    Gregor, Petr
    Skrekovski, Riste
    INFORMATION SCIENCES, 2013, 236 : 224 - 235
  • [36] Embedding and reconfiguration of spanning trees in faulty hypercubes
    Avresky, DR
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (03) : 211 - 222
  • [37] Construction of maximum cycles in faulty binary hypercubes
    P. P. Parkhomenko
    Automation and Remote Control, 2005, 66 : 633 - 645
  • [38] Improved algorithms for computing with faulty SIMD hypercubes
    C.S. Raghavendra
    M.A. Sridhar
    Telecommunication Systems, 1998, 10 : 149 - 156
  • [39] Hamiltonian cycles and paths in faulty twisted hypercubes
    Liu, Huiqing
    Hu, Xiaolan
    Gao, Shan
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 243 - 249
  • [40] Various cycles embedding in faulty balanced hypercubes
    Cheng, Dongqin
    Hao, Rong-Xia
    INFORMATION SCIENCES, 2015, 297 : 140 - 153