scientific article; zbMATH DE number 913340

DOI10.1002/(SICI)1097-0037(199601)27:1%3C19::AID-NET2%3E3.0.CO;2-HzbMATH Open0852.90081WikidataQ56462701 ScholiaQ56462701MaRDI QIDQ4887730FDOQ4887730

Authors: John P. Hayes, Frank Harary 

Publication date: 9 December 1996

Title of this publication is not available (Why is that?)

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

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)

Cited In (28)

• On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs
• On cubic 2-independent Hamiltonian connected graphs
• Vertex extensions of 4-layer graphs and hypercubes
• About uniqueness of the minimal 1-edge extension of hypercube Q4
• Edge fault tolerance in graphs
• On the complexity of some problems related to graph extensions
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Dynamic graph models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fault tolerant reachability for directed graphs
• Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
• The structure of optimal edge fault tolerant graphs of star networks
• Construction schemes for fault-tolerant Hamiltonian graphs
• Title not available (Why is that?)
• ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION
• Fault-tolerant broadcast graphs
• THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS
• Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
• Title not available (Why is that?)
• Node partition formula for directed graph reliability
• Cubic planar Hamiltonian graphs of various types
• Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs

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)