New results for the degree/diameter problem

1995/04/13 by Michael J. Dinneen, Dinneen, Michael J., Paul R. Hafner +1 · 1 citation
Computer Science · Mathematics · #94c15 05c25 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.math/9504214

openalex publication_date 1995/04/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs'' is in the design of efficient communication network topologies.

Cited by

• Computer-assisted graph theory: a survey

Related

• Large Cayley graphs of small diameter
• Table of large graphs with given degree and diameter
• On Word and Gómez Graphs and Their Automorphism Groups in the Degree Diameter Problem
• The degree-diameter problem for circulant graphs of degrees 10 and 11 -\n extended version
• New large graphs with given degree and diameter