Gregarious GDDs with Two Associate Classes

Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/14704

Full metadata record

DC Field	Value	Language
dc.contributor.author	El-Zanati S.I.
dc.contributor.author	Punnim N.
dc.contributor.author	Rodger C.A.
dc.date.accessioned	2021-04-05T03:36:38Z	-
dc.date.available	2021-04-05T03:36:38Z	-
dc.date.issued	2010
dc.identifier.issn	9110119
dc.identifier.other	2-s2.0-77958453563
dc.identifier.uri	https://ir.swu.ac.th/jspui/handle/123456789/14704	-
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-77958453563&doi=10.1007%2fs00373-010-0951-8&partnerID=40&md5=fd7fb365a93500b0d18a8c5790c894e7
dc.description.abstract	The 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.title	Gregarious GDDs with Two Associate Classes
dc.type	Article
dc.rights.holder	Scopus
dc.identifier.bibliograpycitation	Graphs and Combinatorics. Vol 26, No.6 (2010), p.775-780
dc.identifier.doi	10.1007/s00373-010-0951-8
Appears in Collections:	Scopus 1983-2021

Files in This Item:

There are no files associated with this item.