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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.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 |
| Sumario: | 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. |
|---|