Langford sequences and a product of digraphs

Skolem and Langford sequences and their many generalizations have applications in numerous areas. The -product is a generalization of the direct product of digraphs. In this paper we use the -product and super edge-magic digraphs to construct an exponential number of Langford sequences with certain...

Descripción completa

Detalles Bibliográficos
Autores: López Masip, Susana-Clara, Muntaner Batle, Francesc Antoni
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2016
País:España
Institución:Universitat de Lleida (UdL)
Repositorio:Repositori Obert UdL
OAI Identifier:oai:repositori.udl.cat:10459.1/66434
Acceso en línea:https://doi.org/10.1016/j.ejc.2015.11.004
http://hdl.handle.net/10459.1/66434
Access Level:acceso abierto
Palabra clave:Teoria de grafs
Graph theory
id ES_7cf86299af9f3a2f9b5be00e7dec06e5
oai_identifier_str oai:repositori.udl.cat:10459.1/66434
network_acronym_str ES
network_name_str España
repository_id_str
spelling Langford sequences and a product of digraphsLópez Masip, Susana-ClaraMuntaner Batle, Francesc AntoniTeoria de grafsGraph theorySkolem and Langford sequences and their many generalizations have applications in numerous areas. The -product is a generalization of the direct product of digraphs. In this paper we use the -product and super edge-magic digraphs to construct an exponential number of Langford sequences with certain order and defect. We also apply this procedure to extended Skolem sequences.The research conducted in this document by the first author has been supported by the Spanish Research Council under project MTM2011-28800-C02-01 and symbolically by the Catalan Research Council under grant 2014SGR1147.Elsevier2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfhttps://doi.org/10.1016/j.ejc.2015.11.004http://hdl.handle.net/10459.1/66434reponame:Repositori Obert UdL instname:Universitat de Lleida (UdL)Inglésinfo:eu-repo/grantAgreement/MICINN//MTM2011-28800-C02-01Versió postprint del document publicat a: https://doi.org/10.1016/j.ejc.2015.11.004European Journal of Combinatorics, 2016, vol. 53, p. 86-95cc-by-nc-nd (c) Elsevier, 2016info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/3.0/esoai:repositori.udl.cat:10459.1/664342026-06-24T12:42:17Z
dc.title.none.fl_str_mv Langford sequences and a product of digraphs
title Langford sequences and a product of digraphs
spellingShingle Langford sequences and a product of digraphs
López Masip, Susana-Clara
Teoria de grafs
Graph theory
title_short Langford sequences and a product of digraphs
title_full Langford sequences and a product of digraphs
title_fullStr Langford sequences and a product of digraphs
title_full_unstemmed Langford sequences and a product of digraphs
title_sort Langford sequences and a product of digraphs
dc.creator.none.fl_str_mv López Masip, Susana-Clara
Muntaner Batle, Francesc Antoni
author López Masip, Susana-Clara
author_facet López Masip, Susana-Clara
Muntaner Batle, Francesc Antoni
author_role author
author2 Muntaner Batle, Francesc Antoni
author2_role author
dc.subject.none.fl_str_mv Teoria de grafs
Graph theory
topic Teoria de grafs
Graph theory
description Skolem and Langford sequences and their many generalizations have applications in numerous areas. The -product is a generalization of the direct product of digraphs. In this paper we use the -product and super edge-magic digraphs to construct an exponential number of Langford sequences with certain order and defect. We also apply this procedure to extended Skolem sequences.
publishDate 2016
dc.date.none.fl_str_mv 2016
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://doi.org/10.1016/j.ejc.2015.11.004
http://hdl.handle.net/10459.1/66434
url https://doi.org/10.1016/j.ejc.2015.11.004
http://hdl.handle.net/10459.1/66434
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv info:eu-repo/grantAgreement/MICINN//MTM2011-28800-C02-01
Versió postprint del document publicat a: https://doi.org/10.1016/j.ejc.2015.11.004
European Journal of Combinatorics, 2016, vol. 53, p. 86-95
dc.rights.none.fl_str_mv cc-by-nc-nd (c) Elsevier, 2016
info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/3.0/es
rights_invalid_str_mv cc-by-nc-nd (c) Elsevier, 2016
http://creativecommons.org/licenses/by-nc-nd/3.0/es
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositori Obert UdL
instname:Universitat de Lleida (UdL)
instname_str Universitat de Lleida (UdL)
reponame_str Repositori Obert UdL
collection Repositori Obert UdL
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411628862144512
score 15,811543

Similares en LA Referencia