DocumentCode
2108595
Title
Two Edge-Disjoint Hamiltonian Paths in Crossed Cubes
Author
Ma, Deyi ; Liu, Hongmei
Author_Institution
Coll. of Sci., China Three Gorges Univ., Yichang
fYear
2008
fDate
21-22 Dec. 2008
Firstpage
1021
Lastpage
1024
Abstract
The crossed cube, which is introduced by Efe, possesses some properties superior to the hypercube. In this paper, we show that for any n ges 4, there are two edge-disjoint Hamiltonian paths in the n-dimensional crossed cube. Furthermore, there are two edge-disjoint spanning trees and two edge-disjoint Hamiltonian cycles in the n-dimensional crossed cube.
Keywords
hypercube networks; trees (mathematics); crossed cube; edge-disjoint Hamiltonian cycle; edge-disjoint Hamiltonian path; edge-disjoint spanning trees; hypercube; Computational modeling; Computer architecture; Computer networks; Concurrent computing; Educational institutions; Hypercubes; Information technology; Multiprocessor interconnection networks; Parallel processing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Information Technology Application Workshops, 2008. IITAW '08. International Symposium on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3505-0
Type
conf
DOI
10.1109/IITA.Workshops.2008.68
Filename
4732111
Link To Document