Construction schemes for fault-tolerant Hamiltonian graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(200005)35:3<233::AID-NET7>3.0.CO;2-F" /><233::AID-NET7>3.0.CO;2-F 10.1002/(SICI)1097-0037(200005)35:3<233::AID-NET7>3.0.CO;2-FzbMath0967.68016OpenAlexW1971324955MaRDI QIDQ4488864

Lih-Hsing Hsu, Ting-Yi Sung, Chun-Nan Hung, Jeng-Jung Wang, Jimmy J. M. Tan

Publication date: 9 July 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200005)35:3<233::aid-net7>3.0.co;2-f

zbMATH Keywords

cycle extensionsfault-tolerant Hamiltonian graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs ⋮ On cubic 2-independent Hamiltonian connected graphs ⋮ Cubic planar Hamiltonian graphs of various types ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Strong kernel number in certain oriented cycle extension of graphs

Cites Work

• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• Edge fault tolerance in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction schemes for fault-tolerant Hamiltonian graphs