Publication:
Gregarious GDDs with Two Associate Classes

dc.contributor.authorEl-Zanati S.I.
dc.contributor.authorPunnim N.
dc.contributor.authorRodger C.A.
dc.date.accessioned2021-04-05T03:36:38Z
dc.date.available2021-04-05T03:36:38Z
dc.date.issued2010
dc.date.issuedBE2553
dc.description.abstractThe existence of group divisible designs with two associate classes has been studied for over 50 years. Probably the most difficult cases to solve are those in which the number of groups is less than the size of the blocks. Recently, such an existence problem was solved in the case where the groups have the same size and the blocks have size 3. In this paper, we continue to focus on blocks of size 3, solving the existence problem when the required designs are gregarious (each block intersects each group). These designs are tight to construct in the sense that they satisfy equality in one of the bounds required for GDDs to exist. © 2010 Springer.
dc.format.mimetypeapplication/pdf
dc.identifier.citationGraphs and Combinatorics. Vol 26, No.6 (2010), p.775-780
dc.identifier.doi10.1007/s00373-010-0951-8
dc.identifier.issn9110119
dc.identifier.other2-s2.0-77958453563
dc.identifier.urihttps://hdl.handle.net/20.500.14740/7578
dc.rights.holderScopus
dc.titleGregarious GDDs with Two Associate Classes
dc.typeArticle
dspace.entity.typePublication
swu.datasource.scopushttps://www.scopus.com/inward/record.uri?eid=2-s2.0-77958453563&doi=10.1007%2fs00373-010-0951-8&partnerID=40&md5=fd7fb365a93500b0d18a8c5790c894e7

Files