Pages that link to "Item:Q918987"
From MaRDI portal
The following pages link to Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987):
Displaying 8 items.
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Connectivity of consecutive-\(d\) digraphs (Q1199422) (← links)
- Super edge-connectivity of dense digraphs and graphs (Q1199454) (← links)
- Super line-connectivity of consecutive-\(d\) digraphs (Q1382814) (← links)
- An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs (Q1897350) (← links)
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
