New large graphs with given degree and diameter
组合数学
2008-02-03 v1
摘要
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.
引用
@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}
}
备注
12 pages