1 research outputs found
Paired many-to-many 2-disjoint path cover of balanced hypercubes with faulty edges
As a variant of the well-known hypercube, the balanced hypercube was
proposed as a novel interconnection network topology for parallel computing. It
is known that is bipartite. Assume that and
are any two sets of two vertices in different partite sets of
(). It has been proved that there exist two vertex-disjoint
-path and -path of covering all vertices of it. In
this paper, we prove that there always exist two vertex-disjoint -path
and -path covering all vertices of with at most faulty
edges. The upper bound of edge faults tolerated is optimal.Comment: 30 pages, 9 figure