Article citationsMore >>

Haanpaa H. and Kaski P. (2005). The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments. Des. Codes Cryptogr. 35, 271-285.

has been cited by the following article:

Article

Some Constructions of Nearly µ-Resolvable Designs

1School of Statistics, DAVV, Indore, India


American Journal of Applied Mathematics and Statistics. 2018, Vol. 6 No. 2, 36-43
DOI: 10.12691/ajams-6-2-1
Copyright © 2018 Science and Education Publishing

Cite this paper:
Banerjee S., Awad R., Agrawal B.. Some Constructions of Nearly µ-Resolvable Designs. American Journal of Applied Mathematics and Statistics. 2018; 6(2):36-43. doi: 10.12691/ajams-6-2-1.

Correspondence to: Agrawal  B., School of Statistics, DAVV, Indore, India. Email: profbhartiagrawal@gmail.com

Abstract

This paper deals with general construction methods of nearly µ - resolvable balanced incomplete block designs with illustration using nearly one resolvable balanced incomplete block (BIB) designs and some known group divisible (GD) designs.

Keywords