Examples of products giving large graphs with given degree and diameter

DOI10.1016/0166-218X(92)90130-3zbMath0768.05034MaRDI QIDQ1199421

Charles Delorme

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

diameterdegreeMoore boundproducts of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Generalized quadrangles and generalized polygons in finite geometry (51E12) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Distance in graphs (05C12)

Related Items (7)

Asymptotically approaching the Moore bound for diameter three by Cayley graphs ⋮ Approaching the Moore bound for diameter two by Cayley graphs ⋮ Table of large \(({\Delta{}}, D)\)-graphs ⋮ Some new large (Δ, 3)‐graphs ⋮ New largest known graphs of diameter 6 ⋮ A note on large graphs of diameter two and given maximum degree ⋮ Some new large compound graphs

Cites Work

• Large Graphs with Given Degree and Diameter III
• On the Decomposition of Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Examples of products giving large graphs with given degree and diameter