Christmas tree: a versatile 1-fault-tolerant design for token rings
From MaRDI portal
Publication:294701
Recommendations
Cites work
- 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?)
- Edge fault tolerance in graphs
- Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
- On a Problem of Ore
- Optimal 1-Hamiltonian graphs
Cited in
(8)- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian 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
- Globally bi-3*-connected graphs
- Reliability measures in brother trees
- Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
- Construction schemes for fault-tolerant 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)