scientific article; zbMATH DE number 913340

DOI10.1002/(SICI)1097-0037(199601)27:1%3C19::AID-NET2%3E3.0.CO;2-HMaRDI QIDQ4887730zbMATH OpenWikidataFDO

Authors John P. Hayes, Frank Harary

Publication date 9 December 1996

zbMATH Keywords

\(k\)-node fault-tolerant supergraphexact node fault tolerance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• scientific article; zbMATH DE number 861431
• On Minimum Fault-Tolerant Networks
• Edge fault tolerance in graphs
• scientific article; zbMATH DE number 913359
• Faithful 1-edge fault tolerant graphs

Cited in

(30)

• Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
• scientific article; zbMATH DE number 7301718 (Why is no real title available?)
• scientific article; zbMATH DE number 7310069 (Why is no real title available?)
• scientific article; zbMATH DE number 7310088 (Why is no real title available?)
• About uniqueness of the minimal 1-edge extension of hypercube Q4
• The structure of optimal edge fault tolerant graphs of star networks
• scientific article; zbMATH DE number 436067 (Why is no real title available?)
• scientific article; zbMATH DE number 3990887 (Why is no real title available?)
• On cubic 2-independent Hamiltonian connected graphs
• scientific article; zbMATH DE number 913541 (Why is no real title available?)
• ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION
• Dynamic graph models
• Cubic planar Hamiltonian graphs of various types
• Edge fault tolerance in graphs
• Fault tolerant supergraphs with automorphisms
• scientific article; zbMATH DE number 7300406 (Why is no real title available?)
• Fault-tolerant broadcast graphs
• The minimal vertex extensions for colored complete graphs
• Node partition formula for directed graph reliability
• Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs
• On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs
• Realizability of fault-tolerant graphs
• Fault tolerant reachability for directed graphs
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Vertex extensions of 4-layer graphs and hypercubes
• Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension
• Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
• Construction schemes for fault-tolerant Hamiltonian graphs
• On the complexity of some problems related to graph extensions

This page was built for publication:

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