Abstract
Firstly, we give a complete comparison between Agrawal's bounds (1964a) and Shah's bounds (1965) given for the block intersection number of incomplete block designs. That is, it is asserted that Agrawal's bound is generally superior to that given by Shah for certain partially balanced incomplete bloCk (PBIB) designs validating Shah's bounds. Secondly, we compare Agrawal's bound with another general bound for the block intersection numer.
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.
