4-cycle group-divisible designs with two associate classes
From MaRDI portal
The graph \((\lambda_1,\lambda_2) K_{(n,m)}\) has \(mn\) vertices; its vertex set is partitioned into \(m\) groups of size \(n\) each; two vertices are joined by \(\lambda_1\) or \(\lambda_2\) edges according to whether they both belong to the same group, or to different groups. In this paper, necessary and sufficient conditions are obtained for the existence of a decomposition of the graph \((\lambda_1,\lambda_2) K_{(n,m)}\) into 4-cycles for all integers \(m,n\geq 1\), and \(\lambda_1,\lambda_2\geq 0\).
Recommendations
Cited in
(13)- 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\)
- Decomposition of the Kneser graph into paths of length four
- Resolvable 4-cycle group divisible designs with two associate classes: part size even
- Multiply balanced edge colorings of multigraphs
- scientific article; zbMATH DE number 2186971 (Why is no real title available?)
- \(C_4\)-factorizations with two associate classes, \(\lambda_1\) is odd
- Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
- C₄-factorizations with two associate classes
- On z-cycle factorizations with two associate classes where z is 2a and a is even
- On \(z\)-cycle factorizations with two associate classes where \(z\) is in \(\{4,4a\}\) with even parameters
- Matching divisible designs with block size four
- Enclosings of \(\lambda \)-fold 4-cycle systems
- Generalizing Clatworthy group divisible designs
This page was built for publication: 4-cycle group-divisible designs with two associate classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757075)
