Abstract: | A method of constructing resolvable incomplete block designs for v(=ks, 2 ≤ k ≤ s - 1) treatments in blocks of size k using mutually orthogonal Latin squares is proposed. It has been seen in particular that when the number of replications is s — 1 (or s), which is feasible if s is a prime or a prime power, the method gives PBIB (3) (or semi-regular GD) designs. The analysis of such designs has also been discussed. |