The spanning laceability of k-ary n-cubes when k is even

碩士 === 中原大學 === 應用數學研究所 === 98 === Q_n^k has been shown as an alternative to the hypercube family. For any even integer k≥4 and any integer n≥2, Q_n^k is a bipartite graph. In this paper, we will prove that given any pair of vertices, w and b, from different partite sets of Q_n^k, there exist 2n int...

Full description

Bibliographic Details
Main Authors:	Shu-Li Chang, 張書莉
Other Authors:	Shin-Shin Kao
Format:	Others
Language:	zh-TW
Published:	2010
Online Access:	http://ndltd.ncl.edu.tw/handle/69738821798547372929

id	ndltd-TW-098CYCU5507038
record_format	oai_dc
spelling	ndltd-TW-098CYCU55070382015-10-13T18:44:54Z http://ndltd.ncl.edu.tw/handle/69738821798547372929 The spanning laceability of k-ary n-cubes when k is even 當k為偶數時,k位元n維立方體的全覆蓋可蕾絲性 Shu-Li Chang 張書莉碩士中原大學應用數學研究所 98 Q_n^k has been shown as an alternative to the hypercube family. For any even integer k≥4 and any integer n≥2, Q_n^k is a bipartite graph. In this paper, we will prove that given any pair of vertices, w and b, from different partite sets of Q_n^k, there exist 2n internally disjoint paths between w and b, denoted by {P_i \| 0 ≤ i ≤ 2n −1}, such that U_{i=0}^{2n-1}P_i covers all vertices of Q_n^k. The result is optimal since each vertex of Q_n^k has exactly 2n neighbors. Shin-Shin Kao 高欣欣 2010 學位論文 ; thesis 33 zh-TW
collection	NDLTD
language	zh-TW
format	Others
sources	NDLTD
description	碩士 === 中原大學 === 應用數學研究所 === 98 === Q_n^k has been shown as an alternative to the hypercube family. For any even integer k≥4 and any integer n≥2, Q_n^k is a bipartite graph. In this paper, we will prove that given any pair of vertices, w and b, from different partite sets of Q_n^k, there exist 2n internally disjoint paths between w and b, denoted by {P_i \| 0 ≤ i ≤ 2n −1}, such that U_{i=0}^{2n-1}P_i covers all vertices of Q_n^k. The result is optimal since each vertex of Q_n^k has exactly 2n neighbors.
author2	Shin-Shin Kao
author_facet	Shin-Shin Kao Shu-Li Chang 張書莉
author	Shu-Li Chang 張書莉
spellingShingle	Shu-Li Chang 張書莉 The spanning laceability of k-ary n-cubes when k is even
author_sort	Shu-Li Chang
title	The spanning laceability of k-ary n-cubes when k is even
title_short	The spanning laceability of k-ary n-cubes when k is even
title_full	The spanning laceability of k-ary n-cubes when k is even
title_fullStr	The spanning laceability of k-ary n-cubes when k is even
title_full_unstemmed	The spanning laceability of k-ary n-cubes when k is even
title_sort	spanning laceability of k-ary n-cubes when k is even
publishDate	2010
url	http://ndltd.ncl.edu.tw/handle/69738821798547372929
work_keys_str_mv	AT shulichang thespanninglaceabilityofkaryncubeswhenkiseven AT zhāngshūlì thespanninglaceabilityofkaryncubeswhenkiseven AT shulichang dāngkwèiǒushùshíkwèiyuánnwéilìfāngtǐdequánfùgàikělěisīxìng AT zhāngshūlì dāngkwèiǒushùshíkwèiyuánnwéilìfāngtǐdequánfùgàikělěisīxìng AT shulichang spanninglaceabilityofkaryncubeswhenkiseven AT zhāngshūlì spanninglaceabilityofkaryncubeswhenkiseven
_version_	1718036248954667008

The spanning laceability of k-ary n-cubes when k is even

Similar Items