Faithful 1-edge fault tolerant graphs

DOI10.1016/S0020-0190(97)00003-3zbMATH Open1336.68204MaRDI QIDQ286987FDOQ286987

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

Publication date: 26 May 2016

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

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

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)

Cites Work

• Title not available (Why is that?)
• Graph multiplication
• The Kronecker Product of Graphs
• Edge fault tolerance in graphs

Cited In (3)

• Optimal 1-edge fault-tolerant designs for ladders.
• Title not available (Why is that?)
• Faithfulness in chain graphs: the discrete case

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)