Abstract
Majinder [3] obtained an upper bound for the number of disjoint blocks in BIB designs. In this paper we give an upper bound for the number of disjoint blocks in (i) Semi-regular GD designs, (ii) PBIB designs with two associate classes having triangular association scheme, (iii) PBIB designs with two associate classes having $L_2$ association scheme, and (iv) PBIB designs with three associate classes having rectangular association scheme. The main tools used to establish the results of this paper are the theorems proved by (i) Bose and Connor [1], (ii) Raghavarao [4] and (iii) Vartak [6].
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.
