New results for the degree/diameter problem

Simple item page
dc.creatorDinneen, Michael J.
dc.creatorHafner, Paul R.
dc.date1995-04-13
dc.date.accessioned2026-07-07T09:15:19Z
dc.date.available2026-07-07T09:15:19Z
dc.descriptionThe 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/math/9504214
dc.identifierhttp://arxiv.org/abs/math/9504214
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152978
dc.subjectCombinatorics
dc.subject94c15 05c25
dc.titleNew results for the degree/diameter problem
dc.typetext

Files

Collections

arXiv