کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6875623 | 1441976 | 2018 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Super spanning connectivity on WK-recursive networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 713, 22 February 2018, Pages 42-55
Journal: Theoretical Computer Science - Volume 713, 22 February 2018, Pages 42-55
نویسندگان
Lantao You, Jianxi Fan, Yuejuan Han,