Faithful 1-edge fault tolerant graphs

DOI10.1016/S0020-0190(97)00003-3MaRDI QIDQ286987zbMATH OpenFDO

Authors Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung

Publication date 26 May 2016

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

zbMATH Keywords

Kronecker productCartesian productedge fault tolerancemeshestori

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• Edge fault tolerance in graphs
• scientific article; zbMATH DE number 1256708
• Optimal 1-edge fault-tolerant designs for ladders.
• scientific article; zbMATH DE number 861431
• Edge-fault-tolerant strong Menger edge connectivity on regular graphs

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• Edge fault tolerance in graphs
• Graph multiplication
• The Kronecker Product of Graphs

Cited in

(4)

• Optimal 1-edge fault-tolerant designs for ladders.
• scientific article; zbMATH DE number 913340 (Why is no real title available?)
• Faithfulness in chain graphs: the discrete case
• Transformation of grids to 1-fault-tolerant graphs

This page was built for publication: Faithful 1-edge fault tolerant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286987)