Abstract
Let G be an abelian group. A collection of ( G, k, λ) disjoint difference families, { F 0, F 1,…, F s−1} , is a complete set of disjoint difference families if ⋃ 0⩽i⩽s−1⋃ B∈ F i B form a partition of G−{0}. In this paper, several construction methods are provided for complete sets of disjoint difference families. Applications to one-factorizations of complete graphs and to cyclically resolvable cyclic Steiner triple systems are also described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
