Abstract
Algorithms are given for the construction of binary block designs with replications and concurrences differing by at most one. The designs are resolvable and/or connected whenever the parameters permit.
Original language | English |
---|---|
Pages (from-to) | 257-263 |
Number of pages | 7 |
Journal | Journal of Statistical Planning and Inference |
Volume | 10 |
Publication status | Published - 1984 |
Keywords
- incomplete block design
- Latin square
- connected design
- resolvable design
- simple graph