Topological Properties of Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Cycles embedding in hypercubes with node failures
Information Processing Letters
A Comment on "The Exchanged Hypercube'
IEEE Transactions on Parallel and Distributed Systems
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters
On embedding cycles into faulty dual-cubes
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
The domination number of exchanged hypercubes
Information Processing Letters
| Hi-index | 0.89 |
The exchanged hypercube EH(s,t), proposed by Loh et al., is obtained by systematically removing links from a binary hypercube. This paper investigates important properties related to embedding cycles into the exchanged hypercube EH(s,t). The authors show that EH(1,t) and EH(2,2) are not bipancyclic, but EH(s,t) (2=