Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters
Information Processing Letters
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
SIAM Journal on Discrete Mathematics
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
IEEE Transactions on Computers
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Information Processing Letters
Paired many-to-many disjoint path covers of the hypercubes
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
| Hi-index | 0.89 |
Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. In this paper, we investigate the problem of many-to-many unpaired n-disjoint path covers in the n-dimensional hypercube Q"n and obtain the following result. For any two sets S and T of n vertices in different parts, Q"n has many-to-many unpaired n-disjoint (S,T)-path covers except the case that there exists a vertex v such that N"Q"""n(v)=S and v@?T or N"Q"""n(v)=T and v@?S.