کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4627560 | 1631812 | 2014 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Two node-disjoint paths in balanced hypercubes
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Two node-disjoint paths in balanced hypercubes Two node-disjoint paths in balanced hypercubes](/preview/png/4627560.png)
چکیده انگلیسی
The balanced hypercube BHnBHn proposed by Wu and Huang is a variation of the hypercube. It has been proved that the balanced hypercube is a node-transitive and bipartite graph. Assume that the nodes are divided into two bipartite node sets X and Y,u and x are two different nodes in X, and v and y are two different nodes in Y . In this paper, we prove that there exist two node-disjoint paths P[x,y]P[x,y] and R[u,v]R[u,v] in BHnBHn, and V(P[x,y])∪V(R[u,v])=V(BHn)V(P[x,y])∪V(R[u,v])=V(BHn), where n⩾1n⩾1. The Hamiltonian laceability of BHnBHn which was proved by Xu et al. is also obtained from the corollary of our result.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 242, 1 September 2014, Pages 127–142
Journal: Applied Mathematics and Computation - Volume 242, 1 September 2014, Pages 127–142
نویسندگان
Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng,