Abstract
Summary The class of regular graph (RG) designs, conjectured to be optimal among all incomplete block designs, is defined. The results of a systematic search of the class of RG designs are given for all cases in which v ≤ 12, r ≤ 10 and v ≤ b. In nearly every case, the optimum design is determined for each of the three optimality criteria: A, D and E. For v > b, we present the duals of the optimal designs for v < b. Many of the designs are new and these are tabulated in a back-up report.
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 callMore From: Journal of the Royal Statistical Society Series B: Statistical Methodology
Disclaimer: 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.
