The strong Rabin number of a network W of connectivity k is the minimum l so that for any k + 1 nodes s, d 1 , d 2 , . . . , d k of W , there exist k node-disjoint paths from s to d 1 , d 2 , . . . , d k , respectively, whose maximal length is not greater than l, where s / ∈ {d 1 , d 2 , . . . , d k } and d 1 , d 2 , . . . , d k are not necessarily distinct. In this paper, we show that the strong Rabin number of a k-dimensional folded hypercube is k/2 + 1, where k/2 is the diameter of the k-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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.