Carregant...
Carregant...

Vés al contingut (premeu Retorn)

New small regular graphs of girth 5

Autor
Abajo, E.; Araujo-Pardo, G.; Balbuena, C.; Bendala, M.
Tipus d'activitat
Article en revista
Revista
Discrete mathematics
Data de publicació
2017-08
Volum
340
Número
8
Pàgina inicial
1878
Pàgina final
1888
DOI
https://doi.org/10.1016/j.disc.2017.03.020 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0012365X17301000 Obrir en finestra nova
Resum
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...
Paraules clau
Amalgam, Cage, Girth, Small regular graphs
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants