Pages that link to "Item:Q1199426"
From MaRDI portal
The following pages link to Graphs on alphabets as models for large interconnection networks (Q1199426):
Displaying 8 items.
- Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing (Q510568) (← links)
- Diameter vulnerability of GC graphs (Q1408451) (← links)
- Superfluous edges and exponential expansions of de Bruijn and Kautz graphs (Q1827806) (← links)
- Some new large compound graphs (Q1864569) (← links)
- Edge-connectivity and edge-superconnectivity in sequence graphs (Q2384389) (← links)
- Asymptotically large (\(\Delta,D\))-graphs (Q2576342) (← links)
- Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders (Q5236807) (← links)
- Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing (Q6180036) (← links)
