کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
395537 | 665989 | 2011 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube](/preview/png/395537.png)
چکیده انگلیسی
The k-ary n -cube has been one of the most popular interconnection networks for massively parallel systems. Given a set PP of at most 2n − 2 (n ⩾ 2) prescribed edges and two vertices u and v, we show that the 3-ary n-cube contains a Hamiltonian path between u and v passing through all edges of PP if and only if the subgraph induced by PP consists of pairwise vertex-disjoint paths, none of them having u or v as internal vertices or both of them as end-vertices. As an immediate result, the 3-ary n -cube contains a Hamiltonian cycle passing through a set PP of at most 2n − 1 prescribed edges if and only if the subgraph induced by PP consists of pairwise vertex-disjoint paths.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 181, Issue 14, 15 July 2011, Pages 3054–3065
Journal: Information Sciences - Volume 181, Issue 14, 15 July 2011, Pages 3054–3065
نویسندگان
Shiying Wang, Jing Li, Ruixia Wang,