𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity of the crossed cube

✍ Scribed by Priyalal D. Kulasinghe

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
569 KB
Volume
61
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

It was speculated that the connectivity of the n-dimensional crossed cube is n. In this paper we prove that the result is true. @ 1997 Elsevier Science B.V.

πŸ“œ SIMILAR VOLUMES

Hamiltonian connectivity and globally 3βˆ—
Hamiltonian connectivity and globally 3βˆ—-connectivity of dual-cube extensive networks
✍ Shih-Yan Chen; Shin-Shin Kao πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 784 KB

In 2000, Li et al. introduced dual-cube networks, denoted by DC n for n P 1, using the hypercube family Q n and showed the vertex symmetry and some fault-tolerant hamiltonian properties of DC n . In this article, we introduce a new family of interconnection networks called dual-cube extensive networ

The twisted-cube connected networks
The twisted-cube connected networks
✍ Deqiang Wang; Lianchang Zhao πŸ“‚ Article πŸ“… 1999 πŸ› Springer 🌐 English βš– 449 KB
The diameter of the cube-connected cycle
The diameter of the cube-connected cycles
✍ Ivan FriΕ‘; Ivan Havel; Petr Liebl πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 302 KB

Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers.

Multiscattering on the cube-connected cy
Multiscattering on the cube-connected cycles
✍ Jian-jin Li πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 589 KB

This paper presents several multiscattering algorithms on the Cube-Connected Cycles (CCC). We first implement a network-independent greedy algorithm. Then we propose two specialized algorithms for multiscattering on the CCC: the first approach uses only one hypercube link of each cycle, but the seco