New large graphs with given degree and diameter
Combinatorics
2008-02-03 v1
Abstract
In this paper we give graphs with the largest known order for a given degree and diameter . 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 table for graphs.
Keywords
Cite
@article{arxiv.math/9411218,
title = {New large graphs with given degree and diameter},
author = {Francesc Comellas and J. Gómez},
journal= {arXiv preprint arXiv:math/9411218},
year = {2008}
}
Comments
12 pages