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

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

2012-04-19

arxiv.org/abs/1204.4252v1

Mathematics

Combinatorics

Scientific paper

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\leq k\leq n-2$, any two sets $S$ and $T$ of $k$ fault-free vertices in different parts of $Q_n\ (n\geq 3)$, if $f\leq 2n-2k-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-2f$ vertices. This result improves some known results in a sense.

Affiliated with

Also associated with

No associations

Rating

Many-to-many disjoint paths in hypercubes with faulty vertices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Many-to-many disjoint paths in hypercubes with faulty vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Many-to-many disjoint paths in hypercubes with faulty vertices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-34454