A family of graphs and the degree-diameter problem

  • Authors:

  • Geoffrey Exoo

  • Affiliations:

  • Department of Mathematics and Computer Science, Indiana State University, Terre Haute, Indiana 47809, USA

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree-diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We also find a new bound for (3, 6) by an unrelated method. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 118–124, 2001