Abstract
AbstractA ‐group divisible design (GDD) is called simple if no two blocks are identical. Two simple ‐GDDs and are called disjoint if . A set of more than two simple ‐GDDs is called disjoint if each pair of them is disjoint. The collection of disjoint ‐GDDs of type is called a large set. In this paper, we completely solve the existence of large sets of ‐group divisible designs (GDDs) of type and the existence of a simple ‐GDD of type .
Sign-in/Register to access full text options 
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.
