Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875623 | Theoretical Computer Science | 2018 | 14 Pages |
Abstract
The WK-recursive network has received much attention due to its many favorable properties such as small diameter, large connectivity, and high degree of scalability and expandability. In this paper, we consider the super spanning connectivity properties of the WK-recursive network. We use K(d,t) to denote the WK-recursive network of level t, each of which basic modules is a d-vertex complete graph, where d>1 and tâ¥1. We prove that for any two distinct vertices μ and ν, there exist m node disjoint paths whose union covers all the vertices of K(d,t) for dâ¥4, tâ¥1 and 1â¤mâ¤dâ1. Since the connectivity of K(d,t) is dâ1, the result is optimal in the worst case.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Lantao You, Jianxi Fan, Yuejuan Han,