The two-disjoint-cycle-cover pancyclicity of locally twisted cubes

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

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

题名:	The two-disjoint-cycle-cover pancyclicity of locally twisted cubes
作者:	Kung, Tzu-Liang;Chen, Hon-Chan
贡献者:	資訊工程學系
关键词:	Pancyclic;interconnection network;locally twisted cube;two-disjoint-cycle-cover
日期:	2013-12
上传时间:	2013-12-18 02:42:43 (UTC+0)
摘要:	In this paper, a graph G is two-disjoint-cyclecover r-pancyclic if for any integer l satisfying r ? l ? \|V (G)\|?r, there exist two vertex-disjoint cycles C1 and C2 in G such that the lengths of C1 and C2 are l and \|V (G)\|?l, respectively, where \|V (G)\| denotes the total number of vertices in G. Moreover, we define that a graph G is twodisjoint-cycle-cover edge r-pancyclic if for any two vertexdisjoint edges (u, v) and (x, y) of G, there exist two vertexdisjoint cycles C1 and C2 in G such that (i) C1 contains (u, v) with length l for any integer l satisfying r ? l ? \|V (G)\|?r, and (ii) C2 contains (x, y) with length \|V (G)\|?l. Then, we prove that the n-dimensional locally twisted cubes LTQn can be two-disjoint-cycle-cover 4-pancyclic for n ? 3 and two-disjoint-cycle-cover edge 2n-pancyclic for n ? 4.
關聯:	2013全國計算機會議
显示于类别:	[資訊工程學系] 會議論文

文件中的档案:

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

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