Hamilton-connectivity and cycle-embedding of the Möbius cubes
✍ Scribed by Jianxi Fan
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 68 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
The recently introduced interconnection network, the Möbius cube, is an important variant of the hypercube. This network has several attractive properties compared with the hypercube. In this paper, we show that the n-dimensional Möbius cube M n is Hamilton-connected when n 3. Then, by using the Hamilton-connectivity of M n , we also show that any cycle of length l (4 l 2 n ) can be embedded into M n with dilation 1 (n 2). It is a fact that the n-dimensional hypercube Q n does not possess these two properties.
📜 SIMILAR VOLUMES
Let z0 be an arbitrary point in the complex plane. For each positive integer n we choose sn(z) to be -5/(1 + z) or -0.5/(1 + z) with equal probability. We introduce the orbit (zn)~, where zn = Sn(Zn-1) for n > 1. We prove that with probability one the orbit is attracted to the real axis. In the proo
## Abstract The Hamilton—Waterloo problem is to determine the existence of a 2‐factorization of __K__~2__n__+1~ in which __r__ of the 2‐factors are isomorphic to a given 2‐factor __R__ and __s__ of the 2‐factors are isomorphic to a given 2‐factor __S__, with __r__ + __s__=__n__. In this article we
## Abstract The Open Video Digital Library (OVDL) provides digital video files to the education and research community and is distinguished by an innovative user interface that offers multiple kinds of visual surrogates to people searching for video content. The OVDL is used by several thousand peo