Title
On Graph Embedding of Crossed Cube-Connected Ring Networks
Abstract
Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to upgrade crossed cube networks. For example, it is necessary to double the number of nodes to upgrade crossed cube networks. As a kind of hierarchical ring interconnection networks HRN, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. When upgraded, it only needs to be added a crossed cube. In this paper, we prove that, if n≥3, any circle of length l (4≤l≤2^n) can be embedded into CRN(m, n) with dilation 1, and if n≥3, CRN(m, n) is Hamilton-connected. It shows that CRN maintains the Hamilton–connectivity and pancyclicity of crossed cube.
Year
DOI
Venue
2008
10.1109/ICYCS.2008.299
ICYCS
Keywords
Field
DocType
cube-connected ring interconnection network,crossed cube-connected ring networks,cube network,graph embedding,length l,hierarchical ring interconnection network,computational modeling,hypercubes,graph theory,ring network,hypercube,information science
Graph theory,Discrete mathematics,Dilation (morphology),Computer science,Graph embedding,Interconnection,Multiprocessor interconnection,Hypercube,Cube,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
5
Authors
4
Name
Order
Citations
PageRank
Xin Yu183.18
Min Wu23582272.55
Taoshen Li31914.68
Zhaowen Wei400.34