Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1614340 (Why is no real title available?)
- scientific article; zbMATH DE number 1802817 (Why is no real title available?)
- scientific article; zbMATH DE number 5360700 (Why is no real title available?)
- scientific article; zbMATH DE number 3981175 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 1269934 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A survey of Skolem-type sequences and Rosa’s use of them
- Bi-magic and other generalizations of super edge-magic labelings
- Hooked extended Langford sequences of small and large defects
- Labeling constructions using digraph products
- Labeling generating matrices
- Langford sequences: Perfect and hooked
- Magic Valuations of Finite Graphs
- On Langford’s Problem (II)
- Skolem sequences and additive permutations
- Some Remarks on the Triple Systems of Steiner.
- Strong labelings of linear forests
- Strongly indexable graphs
- The intersection spectrum of Skolem sequences and its applications to \(\lambda\)-fold cyclic triple systems
- The intersection spectrum of hooked Skolem sequences and applications
- The place of super edge-magic labelings among other classes of labelings
- The power of digraph products applied to labelings
Cited in
(8)- A new labeling construction from the \(\otimes_h\)-product
- (Di)graph products, labelings and related results
- Langford sequences: Some connections with complete and additive permutations
- On the beta-number of forests with isomorphic components
- Sequential properties of lexicographic products
- Signed Langford sequences and directed cyclic cycle systems
- Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles
- On partitions of {1,…,2m + 1}\{k} into differences d,…,d + m − 1: Extended Langford sequences of large defect
This page was built for publication: Langford sequences and a product of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901157)