The following pages link to How robust is the n-cube? (Q1104728):
Displaying 12 items.
- Hypercube sandwich approach to conferencing. (Q676254) (← links)
- Fault tolerance in \(k\)-ary \(n\)-cube networks (Q690475) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Fault tolerance in bubble-sort graph networks (Q764377) (← links)
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs (Q777422) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- Improving bounds on link failure tolerance of the star graph (Q985078) (← links)
- Application of coding theory to interconnection networks (Q1199457) (← links)
- On \(n\)-column 0,1-matrices with all \(k\)-projections surjective (Q1323388) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Subnetwork preclusion for bubble-sort networks (Q2353651) (← links)
- Robustness of star graph network under link failure (Q2466079) (← links)
