Many-to-many disjoint paths in hypercubes with faulty vertices

Abstract: This paper considers the problem of many-to-many disjoint paths in the hypercube

Q_{n}

with

f

faulty vertices and obtains the following result. For any integer

k

with

1 l e q k l e q n - 2

, any two sets

S

and

T

of

k

fault-free vertices in different parts of

Q_{n} (n g e q 3)

, if

f l e q 2 n - 2 k - 3

and each fault-free vertex has at least two fault-free neighbors, then there exist

k

fully disjoint fault-free paths linking

S

and

T

which contain at least

2^{n} - 2 f

vertices. This result improves some known results in a sense.

Recommendations

Cites work

Cited in

(17)

This page was built for publication: Many-to-many disjoint paths in hypercubes with faulty vertices