GDDs with two associate classes and with one group of size 1 and m groups of size n and λ_1=5,λ_2=1

Main Article Content

Wannee Lapchinda
Avapa Chantasartrassmee
Aisuriya Sudprasert

Abstract

A group divisible design equationequation is an ordered pair equation where equation is an equationset of symbols and equation is a collection of equationsubsets (called blocks) of equation satisfying the following properties: the equation set is divided into equation group of size equation and equation groups of size equation; each pair of symbols from the same group occurs in exactly equation blocks in equation; and each pair of symbols from different groups occurs in exactly equation  blocks in equation. In this paper, we find necessary and sufficient conditions for the existence of a group divisible design group divisible design  equationequation , where equation.

Article Details

How to Cite
Lapchinda, W., Chantasartrassmee, A., & Sudprasert, A. (2025). GDDs with two associate classes and with one group of size 1 and m groups of size n and λ_1=5,λ_2=1. KKU Science Journal, 53(2), 185–190. https://doi.org/10.14456/kkuscij.2025.15
Section
Research Articles

References

Bose R.C. and Shimamoto T. (1952). Classification and analysis of partially balanced incomplete block designs with two associate classes. Journal of the American statistical Association 47(258): 151 - 184. doi: 10.1080/01621459.1952.10501161.

Colbourn, C.J. and Dinitz, J.H. (2007). Handbook of Combinatorial Designs, 2nd edition. Chapman and Hall. CRC Press, Boca Raton. doi: 10.1201/9781420010541.

Fu, H.L. and Rodger, C.A. (1998). Group divisible designs with two associate classes: n=2 or m=2. Journal of Combinatorial Theory, Series A 83(1): 94 - 117.

Fu, H.L., Rodger, C.A. and Sarvate, D.G. (2000). The existence of group divisible designs with first and second associates, having block size 3. Ars Combinatoria 54: 33 - 50.

Lapchinda, W., Punnim, N. and Pabhapote, N. (2013). GDDs with two associate classes with three groups of sizes 1,n,n and λ_1 < λ_2. In: Akiyama, J., Kano, M. and Sakai, T. Computational Geometry and Graphs. TJJCCGG 2012. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg. 8296: 101 - 109.

Lapchinda, W., Punnim, N. and Pabhapote, N. (2014). GDDs with two associate classes and with three groups of sizes 1,n and n. Australasian Journal of Combinatorics 58(2): 292 - 303.

Lapchinda, W. (2019). GDDs with two associate classes and with one group of size 1 and m groups of size n and λ_1=3 , λ_2=1. Walailak Procedia 2019(3): ST.68.

Lindner, C.C. and Rodger, C.A. (2009). Design Theory. 2nd edition. New York: Chapman and Hall/CRC. 272 pp.