On minimum fault-tolerant networks
SIAM Journal on Discrete Mathematics
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes
IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Adding Multiple-Fault Tolerance to Generalized Cube Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal 1-edge fault-tolerant designs for ladders
Information Processing Letters
Survivable Networks with Bounded Delay: The Edge Failure Case
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Discrete Applied Mathematics - Special issue: Max-algebra
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
Proceedings of the 2008 Spring simulation multiconference
Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
Computers & Mathematics with Applications
Discrete Applied Mathematics
Extending a distributed loop network to tolerate node failures
Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
Fault-tolerant circulant digraphs networks
Proceedings of the 2013 Research in Adaptive and Convergent Systems
| Hi-index | 0.00 |
Previous works on edge-fault tolerance with respect to hypercubes Qn are mainly focused on 1-edge fault and 2- or 3-edge fault with limited size of n. We give a construction scheme for 2-EFT(Qn) graphs and 3-EFT(Qn) graphs, where n is arbitrarily large. In our constructions, approximately log n extra degree is added to the vertices of Qn for 2-edge-fault tolerance, and one more degree for 3-edge-fault tolerance.