Complete Cycle Embedding in Crossed Cubes with Two-Disjoint-Cycle-Cover Pancyclicity

勤益科大機構典藏 > 管理學院 > 資訊管理系(研發與科技管理研究所) > 【資訊管理系】期刊論文 > Item 987654321/5911

請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/5911

題名:	Complete Cycle Embedding in Crossed Cubes with Two-Disjoint-Cycle-Cover Pancyclicity
作者:	KUNG, Tzu-Liang CHEN, Hon-Chan
貢獻者:	圖書館
關鍵詞:	pancyclic vertex-disjoint cycles disjoint-cycle cover cycle embedding crossed cube
日期:	2015
上傳時間:	2016-10-18 16:12:42 (UTC+8)
摘要:	A graph G is two-disjoint-cycle-cover 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 \|V(G)\|-l and l, respectively, where \|V(G)\| denotes the total number of vertices in G. In particular, the graph G is two-disjoint-cycle-cover vertex r-pancyclic if for any two distinct vertices u and v of G, there exist two vertex-disjoint cycles C1 and C2 in G such that (i) C1 contains u, (ii) C2 contains v, and (iii) the lengths of C1 and C2 are \|V(G)\|-l and l, respectively, for any integer l satisfying r≤l≤\|V(G)\|-r. Moreover, G is two-disjoint-cycle-cover edge r-pancyclic if for any two vertex-disjoint edges (u,v) and (x,y) of G, there exist two vertex-disjoint cycles C1 and C2 in G such that (i) C1 contains (u,v), (ii) C2 contains (x,y), and (iii) the lengths of C1 and C2 are \|V(G)\|-l and l, respectively, for any integer l satisfying r≤l≤\|V(G)\|-r. In this paper, we first give Dirac-type sufficient conditions for general graphs to be two-disjoint-cycle-cover vertex/edge 3-pancyclic, and we also prove that the n-dimensional crossed cube CQn is two-disjoint-cycle-cover 4-pancyclic for n≥3, vertex 4-pancyclic for n≥5, and edge 6-pancyclic for n≥5.
關聯:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, issue 12, pp. 2670-2676
顯示於類別:	[資訊管理系(研發與科技管理研究所)] 【資訊管理系】期刊論文

文件中的檔案:

沒有與此文件相關的檔案.

檢視Licence

在NCUTIR中所有的資料項目都受到原著作權保護.

資料載入中.....