Embedding a Hamiltonian Cycle in the Crossed Cube with Two Required Vertices in the Fixed Positions

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/18721

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

题名:	Embedding a Hamiltonian Cycle in the Crossed Cube with Two Required Vertices in the Fixed Positions
作者:	龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang
贡献者:	資訊工程學系
关键词:	Hamiltonian;Pancyclic;Cycle embedding;Interconnection network;Crossed cube
日期:	2011-08
上传时间:	2012-11-26 05:57:36 (UTC+0)
摘要:	A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distinct vertices x and y of G , there is a Hamiltonian cycle C of G having d C(x , y ) = l for any integer l satisfying View the MathML source, where dG(x, y) (respectively, dC(x, y)) denotes the distance between vertices x and y in G (respectively, C), and ∣V(G)∣ denotes the total number of vertices of G. As the importance of Hamiltonian properties for data communication among units in an interconnected system, the panpositionable Hamiltonicity involves more flexible message transmission. In this paper, we study this property with respect to the class of crossed cubes, which is a popular variant of the hypercube network.
關聯:	APPLIED MATHEMATICS AND COMPUTATION; 217(24):10058–10065
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

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

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