Abstract
The concept of resolvability and affine resolvability was generalized to $\mu$-resolvability and affine $\mu$-resolvability by Shrikhande and Raghavarao (1964). In this paper, a representation of parameters of an affine $\mu$-resolvable BIB design is given and necessary conditions for the existence of this design are derived. Some methods of constructing (affine) $\mu$-resolvable BIB designs are given and some inequalities for these designs are obtained. Finally, some information on the block structure of $\mu$-resolvable BIB designs is provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
