The Two-Disjoint-Path-Coverable Problem of Crossed Cubes

ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 > Item 310904400/65318

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/65318

题名:	The Two-Disjoint-Path-Coverable Problem of Crossed Cubes
作者:	Chen, Hon-Chan;Kung, Tzu-Liang;Hsu, Li-Yen
贡献者:	資訊工程學系
关键词:	Hamiltonian, Disjoint path cover, Path length, Interconnection network, Crossed cube
日期:	2013-12
上传时间:	2013-12-18 02:42:56 (UTC+0)
摘要:	A graph G is 2-disjoint-path-coverable (2-DPC) if, for any four distinct vertices u, v, x, and y of G, there exist two vertex-disjoint paths P1 and P2 such that (i) P1 joins u and v, (ii) P2 joins x and y, and (iii) P1 ∪ P2 spans G. In this paper, we investigate the 2-DPC problem of the crossed cube with various path lengths. In particu-lar, we prove that the crossed cube can be spanned by two disjoint paths P1 of length l1 and P2 of length l2, where 2n–2 – 1 ? l1 ? 2n–1 – 1 and l2 = 2n – l1 – 2. This result im-proves on the previous one that the two disjoint paths are of equal length.
關聯:	2013全國計算機會議
显示于类别:	[資訊工程學系] 會議論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML	536	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.