Embedding of cycles in twisted cubes with edge-pancyclic
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 264-282 |
Journal / Publication | Algorithmica (New York) |
Volume | 51 |
Issue number | 3 |
Publication status | Published - Jul 2008 |
Link(s)
Abstract
In this paper, we study the embedding of cycles in twisted cubes. It has been proven in the literature that, for any integer l, 4 ≤ l ≤ 2 n , a cycle of length l can be embedded with dilation 1 in an n-dimensional twisted cube, n ≥ 3. We obtain a stronger result of embedding of cycles with edge-pancyclic. We prove that, for any integer l, 4 ≤ l ≤ 2 n , and a given edge (x,y) in an n-dimensional twisted cube, n ≥ 3, a cycle C of length l can be embedded with dilation 1 in the n-dimensional twisted cube such that (x,y) is in C in the twisted cube. Based on the proof of the edge-pancyclicity of twisted cubes, we further provide an O(llog∈l+n 2+nl) algorithm to find a cycle C of length l that contains (u,v) in TQ n for any (u,v) E(TQ n ) and any integer l with 4 ≤ l ≤ 2 n. © 2007 Springer Science+Business Media, LLC.
Research Area(s)
- Cycle, Dilation, Edge-pancyclicity, Embedding, Interconnection network, Twisted cube
Citation Format(s)
Embedding of cycles in twisted cubes with edge-pancyclic. / Fan, Jianxi; Jia, Xiaohua; Lin, Xiaola.
In: Algorithmica (New York), Vol. 51, No. 3, 07.2008, p. 264-282.
In: Algorithmica (New York), Vol. 51, No. 3, 07.2008, p. 264-282.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review