New results for the degree/diameter problem
Combinatorics
2008-02-03 v1
Abstract
The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs'' is in the design of efficient communication network topologies.
Cite
@article{arxiv.math/9504214,
title = {New results for the degree/diameter problem},
author = {Michael J. Dinneen and Paul R. Hafner},
journal= {arXiv preprint arXiv:math/9504214},
year = {2008}
}
Comments
15 pages