Optimal 1-edge fault-tolerant designs for ladders.

DOI10.1016/S0020-0190(02)00225-9zbMath1042.68089MaRDI QIDQ1853116

Chung-Haw Chang, Yen-Chu Chuang, Lih-Hsing Hsu

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Cartesian productFault toleranceMeshesEdge fault toleranceLadders

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Developing fault-tolerant distributed loops ⋮ Applying fault-tolerant solutions of circulant graphs to multidimensional meshes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faithful 1-edge fault tolerant graphs
• Tolerating faulty edges in a multi-dimensional mesh
• MinimumK-hamiltonian graphs
• Minimumk-hamiltonian graphs, II
• On Minimum Fault-Tolerant Networks
• Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
• Fault-tolerant graphs for tori
• Edge fault tolerance in graphs
• An observation on the bisectional interconnection networks

This page was built for publication: Optimal 1-edge fault-tolerant designs for ladders.