Pages that link to "Item:Q294701"
From MaRDI portal
The following pages link to Christmas tree: a versatile 1-fault-tolerant design for token rings (Q294701):
Displaying 8 items.
- Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs (Q949579) (← links)
- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs (Q1007617) (← links)
- Globally bi-3*-connected graphs (Q1025446) (← links)
- Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) (Q1036825) (← links)
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs (Q1765415) (← links)
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks (Q2572044) (← links)
- Construction schemes for fault-tolerant Hamiltonian graphs (Q4488864) (← links)
- Reliability measures in brother trees (Q6560777) (← links)
