Abstract
Abstract Let υ be a positive integer, and K and M be two sets of positive integers. A group divisible design GD (K,M ;υ) is an ordered triple ( X,G,B ) where X is a set with cardinality υ, G is a set of subsets (called groups) of X such that G partitions X and ∣G∣ ∈ M for each G ∈ G , and B is a set of subsets (called blocks) of X such that ∣B∣ ∈ K for each B ∈ B , with the property that each pair of distinct elements of X is contained either in a unique group or in a unique block, but not both. The number υ is called the order of the group divisible design.
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.
