Francesc Comellas, J. Gómez
Published 1994-11-03Version 1
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.
Table of large graphs with given degree and diameter
Very large graphs
Many Hamiltonian subsets in large graphs with given density
![QR code for arXiv:math/9411218 [math.CO]](http://oss.arxitics.com/images/favicon.svg)