Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

Given a set $\pc=\{a_i,b_i\}_{i=1}^m$ of pairs of vertices in a graph $G$, is there a collection of paths $\{P_i\}_{i=1}^m$ such that $P_i$ connects $a_i$ with $b_i$ and $\{V(P_i)\}_{i=1}^m$ partitions $V(G)$? We study this problem for the graph $Q_n-\ff$ obtained from the $n$-dimensional hypercube $Q_n$ by removing a set $\ff$ of faulty vertices. We show that an obvious necessary condition for the existence of such a partition is also sufficient provided $2|\pc|+ 3|\ff|\le n-3$. As a corollary, we obtain a similar characterization for the existence of a hamiltonian cycle and a hamiltonian path of $Q_n-\ff$ provided $|\ff|\le(n-5)/3$. On the other hand, if the size of $\ff$ is not limited, the problems are NP-complete.

[1]  Jung-Sheng Fu.  Fault-tolerant cycle embedding in the hypercube , 2003, Parallel Comput..

[2]  Mee Yee Chan,et al.  On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..

[3]  I. Havel.  On Hamiltonian circuits and spanning trees of hypercubes , 1984 .

[4]  Tomás Dvorák,et al.  Hamiltonian Cycles with Prescribed Edges in Hypercubes , 2005, SIAM J. Discret. Math..

[5]  Tao Tao,et al.  Compressing bitmap indices by data reorganization , 2005, 21st International Conference on Data Engineering (ICDE'05).

[6]  D. Djoković.  Distance-preserving subgraphs of hypercubes , 1973 .

[7]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[8]  Hikoe Enomoto,et al.  Partitions of a graph into paths with prescribed endvertices and lengths , 2000, J. Graph Theory.

[9]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[10]  Yaagoub Ashir,et al.  Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes , 2002, SIAM J. Discret. Math..

[11]  Václav Koubek,et al.  Spanning multi-paths in hypercubes , 2007, Discret. Math..

[12]  Jimmy J. M. Tan,et al.  Fault-tolerant hamiltonian laceability of hypercubes , 2002, Inf. Process. Lett..

[13]  M. Lewinter,et al.  Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs , 1997 .

[14]  Jung-Sheng Fu.  Longest fault-free paths in hypercubes with vertex faults , 2006, Inf. Sci..

[15]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[16]  Petr Gregor,et al.  Spanning paths in hypercubes , 2005 .

[17]  Dana S. Richards.  Data Compression and Gray-Code Sorting , 1986, Inf. Process. Lett..

[18]  Hyeong-Seok Lim,et al.  Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements , 2006, IEEE Transactions on Parallel and Distributed Systems.

[19]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[20]  Chang-Hsiung Tsai.  Linear array and ring embeddings in conditional faulty hypercubes , 2004, Theor. Comput. Sci..