scientific article; zbMATH DE number 913340

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199601)27:1<19::AID-NET2>3.0.CO;2-H" /><19::AID-NET2>3.0.CO;2-H 10.1002/(SICI)1097-0037(199601)27:1<19::AID-NET2>3.0.CO;2-HzbMath0852.90081MaRDI QIDQ4887730

John P. Hayes, Frank Harary

Publication date: 9 December 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (21)

Edge fault tolerance in graphs ⋮ Optimal 1-Hamiltonian graphs ⋮ Christmas tree: a versatile 1-fault-tolerant design for token rings ⋮ Vertex extensions of 4-layer graphs and hypercubes ⋮ THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS ⋮ Dynamic graph models ⋮ On the complexity of some problems related to graph extensions ⋮ On the construction of combinedk-fault-tolerant Hamiltonian graphs ⋮ ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION ⋮ Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs ⋮ On cubic 2-independent Hamiltonian connected graphs ⋮ Construction schemes for fault-tolerant Hamiltonian graphs ⋮ Cubic planar Hamiltonian graphs of various types ⋮ Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs ⋮ Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ About uniqueness of the minimal 1-edge extension of hypercube Q4

This page was built for publication: