Christmas tree: a versatile 1-fault-tolerant design for token rings
DOI10.1016/S0020-0190(99)00122-2zbMATH Open1338.68219WikidataQ115565865 ScholiaQ115565865MaRDI QIDQ294701FDOQ294701
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
Cited In (8)
- Reliability measures in brother trees
- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
- Construction schemes for fault-tolerant Hamiltonian graphs
- Globally bi-3*-connected graphs
- Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
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)