کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
455795 695555 2009 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Strongly Hamiltonian laceability of the even k-ary n-cube
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
Strongly Hamiltonian laceability of the even k-ary n-cube
چکیده انگلیسی

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks can be viewed as the subclasses of the k-ary n-cubes include the cycle, the torus and the hypercube. A bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every two vertices which are in distinct partite sets. A bipartite graph G is strongly Hamiltonian laceable if it is Hamiltonian laceable and there exists a path of length N − 2 joining each pair of vertices in the same partite set, where N = |V(G)|. We prove that the k-ary n-cube is strongly Hamiltonian laceable for k is even and n ⩾ 2.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Electrical Engineering - Volume 35, Issue 5, September 2009, Pages 659–663
نویسندگان
,