Pages that link to "Item:Q3346353"
From MaRDI portal
The following pages link to Large Graphs with Given Degree and Diameter—Part I (Q3346353):
Displayed 10 items.
- Large graphs with given degree and diameter. II (Q793749) (← links)
- Graphs of order two less than the Moore bound (Q924968) (← links)
- Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
- Tables of large graphs with given degree and diameter (Q1164611) (← links)
- Graphs on alphabets as models for large interconnection networks (Q1199426) (← links)
- Table of large \(({\Delta{}}, D)\)-graphs (Q1199460) (← links)
- Diameter vulnerability of GC graphs (Q1408451) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Bus interconnection networks (Q1917343) (← links)
- On new record graphs close to bipartite Moore graphs (Q2152609) (← links)