New results for the degree/diameter problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
15 pages

Keywords

Combinatorics, 94c15 05c25

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/152978

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9504214
 http://arxiv.org/abs/math/9504214

Collections

arXiv