Embedding paths of different lengths into crossed cubes
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings |
| Pages | 1008-1012 |
| Volume | 2005 |
| Publication status | Published - 2005 |
Publication series
| Name | |
|---|---|
| Volume | 2005 |
Conference
| Title | 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 |
|---|---|
| Place | China |
| City | Dalian |
| Period | 5 - 8 December 2005 |
Link(s)
Abstract
Crossed cubes are attractive alternatives to the popular hypercubes with many advantageous properties. In this paper, we study embeddings of paths of different lengths between any two distinct nodes in crossed cubes. We prove two important results: (a) Paths of all possible lengths greater than or equal to the distance between any two nodes plus 2 can be embedded between the two nodes with dilation 1; And (b) in the n-dimensional crossed cube, for any two integers n ≥ 3 and l with 1 ≤ l ≤ [n+1/2] - 1, there always exist two nodes x and y, such that the distance between x and y is l and any path of length l + 1 cannot be embedded between x and y with dilation 1. The results improve those provided by Fan, Lin, and Jia. © 2005 IEEE.
Research Area(s)
- Crossed cube, Graph embedding, Interconnection network, Parallel computing system
Citation Format(s)
Embedding paths of different lengths into crossed cubes. / Fan, Jianxi; Lin, Xiaola; Jia, Xiaohua.
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings. Vol. 2005 2005. p. 1008-1012 1579084.Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
