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

DOI10.1016/S0020-0190(99)00122-2zbMath1338.68219WikidataQ115565865 ScholiaQ115565865MaRDI QIDQ294701

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

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

fault-tolerance1-Hamiltonian graphsHamiltonian-connected graphstoken rings

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) 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 (7)

Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs ⋮ Construction schemes for fault-tolerant Hamiltonian graphs ⋮ Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs ⋮ 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)\) ⋮ The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks

Cites Work

• Optimal 1-Hamiltonian graphs
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• Edge fault tolerance in graphs
• On a Problem of Ore
• Unnamed Item
• Unnamed Item
• Unnamed Item

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