Balanced directed cycle designs based on groups
From MaRDI portal
A balanced directed cycle design with parameter \((v,k,\lambda)\) is a decomposition of the complete directed multigraph \(\lambda K_ v\) into edge disjoint directed cycles \(C_ k\). New constructions and characterizations of such designs invariant under a group acting regularly on the points are given. Some of the constructions extend previous results by \textit{N. Brand} and \textit{W. C. Huffman} [``Mendelsohn designs admitting the affine group, Graphs Comb. 3, 313-324 (1987; Zbl 0659.05022)].
Recommendations
- scientific article; zbMATH DE number 794250
- Cycles in the block-intersection graph of pairwise balanced designs
- Circular neighbor-balanced designs using cyclic shifts
- scientific article; zbMATH DE number 2186971
- scientific article; zbMATH DE number 3967726
- Balanced n-Ary Designs
- scientific article; zbMATH DE number 3896945
- Construction of balanced incomplete block designs using cyclic shifts
- A new technique for constructing pairwise balanced designs from groups.
Cites work
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Decomposition of the complete directed graph into k-circuits
- Graph decompositions, handcuffed prisoners and balanced p-designs
- scientific article; zbMATH DE number 3887706 (Why is no real title available?)
- scientific article; zbMATH DE number 3875297 (Why is no real title available?)
- scientific article; zbMATH DE number 3675916 (Why is no real title available?)
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- scientific article; zbMATH DE number 3517174 (Why is no real title available?)
- Invariants and constructions of Mendelsohn designs
- Mendelsohn designs admitting the affine group
- On the construction of handcuffed designs
Cited in
(3)
This page was built for publication: Balanced directed cycle designs based on groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182947)
