@article{(Open Science Index):https://publications.waset.org/pdf/14139, title = {The Spanning Laceability of k-ary n-cubes when k is Even}, author = {Yuan-Kang Shih and Shu-Li Chang and Shin-Shin Kao}, country = {}, institution = {}, abstract = {Qk n has been shown as an alternative to the hypercube family. For any even integer k ≥ 4 and any integer n ≥ 2, Qk n is a bipartite graph. In this paper, we will prove that given any pair of vertices, w and b, from different partite sets of Qk n, there exist 2n internally disjoint paths between w and b, denoted by Pi | 0 ≤ i ≤ 2n-1, such that 2n-1 i=0 Pi covers all vertices of Qk n. The result is optimal since each vertex of Qk n has exactly 2n neighbors.}, journal = {International Journal of Mathematical and Computational Sciences}, volume = {4}, number = {12}, year = {2010}, pages = {1499 - 1507}, ee = {https://publications.waset.org/pdf/14139}, url = {https://publications.waset.org/vol/48}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 48, 2010}, }