Christmas tree: a versatile 1-fault-tolerant design for token rings

DOI10.1016/S0020-0190(99)00122-2MaRDI QIDQ294701zbMATH OpenWikidataFDO

Authors Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung

Publication date 16 June 2016

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

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019099001222?np=y

zbMATH Keywords

1-Hamiltonian graphsfault-toleranceHamiltonian-connected graphstoken rings

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Chordal rings as fault-tolerant loops
• Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
• scientific article; zbMATH DE number 913359
• scientific article; zbMATH DE number 861306
• Analysis and design of a fault-tolerant tree architecture

Cites work

• Edge fault tolerance in graphs
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• scientific article; zbMATH DE number 4137792 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 913340 (Why is no real title available?)
• On a Problem of Ore
• Optimal 1-Hamiltonian graphs

Cited in

(9)

• Brother trees: A family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
• Globally bi-3*-connected graphs
• Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
• Construction schemes for fault-tolerant Hamiltonian graphs
• Reliability measures in brother trees
• Dominated coloring in certain trees
• Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs

This page was built for publication: Christmas tree: a versatile 1-fault-tolerant design for token rings

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