dc.contributor
Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental
dc.contributor
Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author
Abajo, E.
dc.contributor.author
Araujo Pardo, Gabriela
dc.contributor.author
Balbuena Martínez, Maria Camino Teófila
dc.contributor.author
Bendala García, Manuel Francisco
dc.identifier
Abajo, E. [et al.]. New small regular graphs of girth 5. "Discrete mathematics", Agost 2017, vol. 340, núm. 8, p. 1878-1888.
dc.identifier
https://hdl.handle.net/2117/184875
dc.identifier
10.1016/j.disc.2017.03.020
dc.description.abstract
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.description.abstract
A (k,g)-graph is a k-regular graph with girth g and a (k,g)-cage is a (k,g)-graph with the fewest possible number of vertices. The cage problem consists of constructing (k,g)-graphs of minimum order n(k,g). We focus on girth g=5, where cages are known only for degrees k=7. We construct (k,5)-graphs using techniques exposed by Funk (2009) and Abreu et al. (2012) to obtain the best upper bounds on n(k,5) known hitherto. The tables given in the introduction show the improvements obtained with our results.
dc.description.abstract
Peer Reviewed
dc.description.abstract
Postprint (author's final draft)
dc.format
application/pdf
dc.relation
http://www.sciencedirect.com/science/article/pii/S0012365X17301000
dc.subject
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subject
Small regular graphs
dc.subject
Grafs, Teoria de
dc.subject
Classificació AMS::05 Combinatorics::05C Graph theory
dc.title
New small regular graphs of girth 5
