New large graphs with given degree and diameter

Simple item page
dc.creatorComellas, Francesc
dc.creatorGómez, J.
dc.date1994-11-03
dc.date.accessioned2026-07-07T09:15:12Z
dc.date.available2026-07-07T09:15:12Z
dc.descriptionIn this paper we give graphs with the largest known order for a given degree $Δ$ and diameter $D$. 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 $(Δ, D)$ table for graphs.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/9411218
dc.identifierhttp://arxiv.org/abs/math/9411218
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152941
dc.subjectCombinatorics
dc.subject05C12 05C35
dc.titleNew large graphs with given degree and diameter
dc.typetext

Files

Collections

arXiv