Langford sequences and a product of digraphs
MetadataShow full item record
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.
Is part ofEuropean Journal of Combinatorics, 2016, vol. 53, p. 86-95
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Elsevier, 2013)In this paper we study the edge-magicness of graphs with equal size and order, and we use such graphs and digraph products in order to construct labelings of different classes and of different graphs. We also study super ...
Ichishima, R.; López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Elsevier, 2012)The ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families of (super) edge-magic graphs and to prove that some of those families admit an exponential number of (super) edge-magic ...
López Masip, Susana-Clara; Muntaner Batle, F. A. (University of Primorska, 2017)A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a path of order 2m in which each label from d up to d + m − 1 appears twice and in which the vertices that have been labeled ...