Large Graphs with Given Degree and Diameter—Part I

DOI10.1109/TC.1984.1676504zbMath0553.05042OpenAlexW1691234079MaRDI QIDQ3346353

Charles Delorme, Guy Farhi

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1984.1676504

zbMATH Keywords

diameterdegreeinterconnection networks(d,k)-graph problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

On new record graphs close to bipartite Moore graphs ⋮ Communication aspects of networks based on geometric incidence relations ⋮ Bus interconnection networks ⋮ Diameter vulnerability of GC graphs ⋮ Tables of large graphs with given degree and diameter ⋮ Graphs of order two less than the Moore bound ⋮ Graphs on alphabets as models for large interconnection networks ⋮ Table of large \(({\Delta{}}, D)\)-graphs ⋮ Matchings and covers in hypergraphs ⋮ Large graphs with given degree and diameter. II

This page was built for publication: Large Graphs with Given Degree and Diameter—Part I