Elliptic semiplanes and regular graphs with girth 5

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 con structing (k, g)-graphs of minimum order n(k, g). We focus on girth g = 5, where cages are known only for degrees k ≤ 7. Considering the...

ver descrição completa

Detalhes bibliográficos
Autores: Abajo Casado, María Encarnación, Balbuena, C., Bendala García, Manuel Francisco
Formato: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2018
País:España
Recursos:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/163355
Acesso em linha:https://hdl.handle.net/11441/163355
https://doi.org/10.1016/j.endm.2018.06.042
Access Level:acceso abierto
Palavra-chave:Regular graphs
Girth
Cage
Amalgam
id ES_98a4a320ebbddc4d5009eaa467e1bb00
oai_identifier_str oai:idus.us.es:11441/163355
network_acronym_str ES
network_name_str España
repository_id_str
spelling Elliptic semiplanes and regular graphs with girth 5Abajo Casado, María EncarnaciónBalbuena, C.Bendala García, Manuel FranciscoRegular graphsGirthCageAmalgamA (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 con structing (k, g)-graphs of minimum order n(k, g). We focus on girth g = 5, where cages are known only for degrees k ≤ 7. Considering the relationship between fi nite geometries and graphs we establish upper constructive bounds on n(k, 5), for k ∈ {13, 14, 17, 18,.. .} that improve the best so far known.ElsevierMatemática Aplicada I2018info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/163355https://doi.org/10.1016/j.endm.2018.06.042reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésElectronic Notes In Discrete Mathematics, 68, 245-250.https://www.sciencedirect.com/science/article/abs/pii/S1571065318301331?via%3Dihubinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/1633552026-06-17T12:51:07Z
dc.title.none.fl_str_mv Elliptic semiplanes and regular graphs with girth 5
title Elliptic semiplanes and regular graphs with girth 5
spellingShingle Elliptic semiplanes and regular graphs with girth 5
Abajo Casado, María Encarnación
Regular graphs
Girth
Cage
Amalgam
title_short Elliptic semiplanes and regular graphs with girth 5
title_full Elliptic semiplanes and regular graphs with girth 5
title_fullStr Elliptic semiplanes and regular graphs with girth 5
title_full_unstemmed Elliptic semiplanes and regular graphs with girth 5
title_sort Elliptic semiplanes and regular graphs with girth 5
dc.creator.none.fl_str_mv Abajo Casado, María Encarnación
Balbuena, C.
Bendala García, Manuel Francisco
author Abajo Casado, María Encarnación
author_facet Abajo Casado, María Encarnación
Balbuena, C.
Bendala García, Manuel Francisco
author_role author
author2 Balbuena, C.
Bendala García, Manuel Francisco
author2_role author
author
dc.contributor.none.fl_str_mv Matemática Aplicada I
dc.subject.none.fl_str_mv Regular graphs
Girth
Cage
Amalgam
topic Regular graphs
Girth
Cage
Amalgam
description 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 con structing (k, g)-graphs of minimum order n(k, g). We focus on girth g = 5, where cages are known only for degrees k ≤ 7. Considering the relationship between fi nite geometries and graphs we establish upper constructive bounds on n(k, 5), for k ∈ {13, 14, 17, 18,.. .} that improve the best so far known.
publishDate 2018
dc.date.none.fl_str_mv 2018
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/163355
https://doi.org/10.1016/j.endm.2018.06.042
url https://hdl.handle.net/11441/163355
https://doi.org/10.1016/j.endm.2018.06.042
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Electronic Notes In Discrete Mathematics, 68, 245-250.
https://www.sciencedirect.com/science/article/abs/pii/S1571065318301331?via%3Dihub
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869414209856471040
score 15,81155

Registos relacionados