Optimal 1-edge fault-tolerant designs for ladders

Authors:
Yen-Chu Chuang;Lih-Hsing Hsu;Chung-Haw Chang
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 30050, ROC;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 30050, ROC;Ming-Hsin Institute of Technology, Hsinchu, Taiwan, ROC
Venue:
Information Processing Letters
Year:
2002

Citing 10
Cited 5

Topological graph theory

Topological graph theory
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
An Observation on the Bisectional Interconnection Networks

IEEE Transactions on Computers
On minimum fault-tolerant networks

SIAM Journal on Discrete Mathematics
Tolerating faulty edges in a multi-dimensional mesh

Parallel Computing
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes

IEEE Transactions on Computers
On the construction of fault-tolerant Cube-Connected Cycles networks

Journal of Parallel and Distributed Computing
Faithful 1-edge fault tolerant graphs

Information Processing Letters
Multiple-Edge-Fault Tolerance with Respect to Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Adding Multiple-Fault Tolerance to Generalized Cube Networks

IEEE Transactions on Parallel and Distributed Systems

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
Developing fault-tolerant distributed loops

Information Processing Letters
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

Quantified Score

Hi-index	0.89

Visualization

Abstract

A graph G* is 1-edge fault-tolerant with respect to a graph G, denoted by 1-EFT(G), if every graph obtained by removing any edge from G* contains G. A 1-EFT(G) graph is optimal if it contains the minimum number of edges among all 1-EFT(G) graphs. The kth ladder graph, Lk, is defined to be the cartesian product of the Pk and P2 where Pn is the n-vertex path graph. In this paper, we present several 1-edge fault-tolerant graphs with respect to ladders. Some of these graphs are proven to be optimal.