Abstract
An incomplete-block design defines both a concurrence graph and a Levi graph. Properties of either graph can be used to compare designs with respect to D-optimality and with respect to A-optimality. In this paper, we show that optimality of the design implies strong conditions on connectivity properties of the graph, and use this to classify the optimal designs when the number of observational units is close to minimal.
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.
