Strong Rabin numbers of folded hypercubes

Abstract: The strong Rabin number of a network of connectivity is the minimum so that for any nodes , of , there exist node-disjoint paths from to , respectively, whose maximal length is not greater than , where and are not necessarily distinct. In this paper, we show that the strong Rabin number of a -dimensional folded hypercube is , where is the diameter of the -dimensional folded hypercube. Each node-disjoint path we obtain has length not greater than the distance between the two end nodes plus two. This paper solves an open problem raised by Liaw and Chang. [Copyright &y& Elsevier]