𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On crossing numbers of hypercubes and cube connected cycles

✍ Scribed by Ondrej Sýkora; Imrich Vrťo

Publisher
Springer Netherlands
Year
1993
Tongue
English
Weight
323 KB
Volume
33
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Construction of Fault-Tolerant Cu
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks
✍ J. Bruck; R. Cypher; C.T. Ho 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 772 KB

This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole

An improved upper bound on the crossing
An improved upper bound on the crossing number of the hypercube
✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej Sýkora; Imrich Vrt' 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph

Hamilton-connectivity and cycle-embeddin
Hamilton-connectivity and cycle-embedding of the Möbius cubes
✍ Jianxi Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

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 Ham

On the Number of Cycles in 3-Connected C
On the Number of Cycles in 3-Connected Cubic Graphs
✍ R.E.L Aldred; Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie