Deadlock-free multicast wormhole routing in multicomputer networks
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
IEEE Transactions on Computers
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Cycles in Networks
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Highly fault-tolerant cycle embeddings of hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Fault-tolerant pancyclicity of augmented cubes
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Embedding of meshes in Möbius cubes
Theoretical Computer Science
Embedding a family of 2D meshes into Möbius cubes
WSEAS Transactions on Mathematics
Embedding geodesic and balanced cycles into hypercubes
WSEAS Transactions on Mathematics
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
| Hi-index | 0.89 |
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 Mn is Hamilton-connected when n ≥ 3. Then, by using the Hamilton-connectivity of Mn, we also show that any cycle of length l (4 ≤ l ≤ 2n) can be embedded into Mn with dilation 1 (n ≥ 2). It is a fact that the n-dimensional hypercube Qn does not possess these two properties.