New large graphs with given degree and diameter

Abstract

In this paper we give graphs with the largest known order for a given degree $\Delta$ and diameter $D$. The graphs are constructed from Moore bipartite graphs by replacement of some vertices by adequate structures. The paper also contains the latest version of the $(\Delta ,D)$ table for graphs.

12 pages

Cited by in corpus (2)

• Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
• Papillon: Greedy Routing in Rings