Flip-Trees: Fault-Tolerant Graphs with Wide Containers
IEEE Transactions on Computers - Fault-Tolerant Computing
Bisectional Fault-Tolerant Communication Architecture for Supercomputer Systems
IEEE Transactions on Computers
Embedding trees in the hypercube
Embedding trees in the hypercube
Graph Theory With Applications
Graph Theory With Applications
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes
IEEE Transactions on Computers
Optimal 1-edge fault-tolerant designs for ladders
Information Processing Letters
| Hi-index | 14.98 |
It is shown that the bisectional interconnection network (BIN) of 2/sup n/ nodes for any even n is isomorphic to the n-dimensional folded hypercube (FHC), an n-dimensional hypercube with additional edges between any two nodes that are of Hamming distance n apart. This observation leads to simplification for the proofs of many interesting properties for the BIN. Inspired by the isomorphism between BIN and FHC, the class of topologies in which nodes are represented by bit strings and two nodes are adjacent if and only if the bitwise Exclusive-OR of their addresses fall in a set of predefined bit string patterns are studied. A few theorems are given to characterize the topology from the mathematical properties of the binary matrix derived from the definition of edges.