کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
420218 | 683907 | 2011 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Hamiltonian cycles passing through linear forests in kk-ary nn-cubes
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Hamiltonian cycles passing through linear forests in kk-ary nn-cubes Hamiltonian cycles passing through linear forests in kk-ary nn-cubes](/preview/png/420218.png)
چکیده انگلیسی
The kk-ary nn-cube is one of the most popular interconnection networks for parallel and distributed systems. A linear forest in a graph is a subgraph, each component of which is a path. In this paper, we investigate the existence of Hamiltonian cycles passing through linear forests in the kk-ary nn-cube. For any n≥2n≥2 and k≥3k≥3, we show that the kk-ary nn-cube admits a Hamiltonian cycle passing through a linear forest with at most 2n−12n−1 edges.
► The kk-ary nn-cube admits a Hamiltonian cycle passing through a prescribed linear forest.
► The number of edges in the prescribed linear forest does not exceed 2n−12n−1.
► This generalized Dvor˘ák’s results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 159, Issue 14, 28 August 2011, Pages 1425–1435
Journal: Discrete Applied Mathematics - Volume 159, Issue 14, 28 August 2011, Pages 1425–1435
نویسندگان
Shiying Wang, Yuxing Yang, Jing Li, Shangwei Lin,