scholarly journals Correction to: Optimal Incomplete-Block Designs with Low Replication: A Unified Approach Using Graphs

2021 ◽  
Vol 15 (4) ◽  
Author(s):  
R. A. Bailey ◽  
Alia Sajjad
2021 ◽  
Vol 15 (4) ◽  
Author(s):  
R. A. Bailey ◽  
Alia Sajjad

AbstractAn 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.


1978 ◽  
Vol 90 (2) ◽  
pp. 395-400 ◽  
Author(s):  
H. D. Patterson ◽  
E. R. Williams ◽  
E. A. Hunter

SummaryIn this paper we present a series of resolvable incomplete block designs suitable for variety trials with any number of varieties v in the range 20 ≤v ≤ 100. These designs usefully supplement existing square and rectangular lattices. They are not necessarily optimal in the sense of having smallest possible variances but their efficiencies are known to be high.


1975 ◽  
Vol 3 (2) ◽  
pp. 285-288
Author(s):  
H. T. Trivedi ◽  
V. K. Sharma

1990 ◽  
Vol 32 (3) ◽  
pp. 337-344 ◽  
Author(s):  
Sudhir Gupta ◽  
Rahul Mukerjee

1953 ◽  
Vol 24 (1) ◽  
pp. 123-126 ◽  
Author(s):  
H. O. Hartley ◽  
S. S. Shrikhande ◽  
W. B. Taylor

Sign in / Sign up

Export Citation Format

Share Document