D-optimal block designs with at most six varieties

DOI10.1016/0378-3758(82)90088-XzbMath0481.62058OpenAlexW1986370089MaRDI QIDQ1162329

Norbert Gaffke

Publication date: 1982

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(82)90088-x

zbMATH Keywords

multigraphcomplexityspanning treebalanced block designregular graph design

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Trees (05C05) Extremal problems in graph theory (05C35) Statistical block designs (62K10)

Related Items

D-optimal designs with minimal and nearly minimal number of units, A-optimal connected block designs with nearly minimal number of observations, A note on robustness of D-optimal block designs for two-colour microarray experiments, Simultaneous choice of time points and the block design in the growth curve model, Construction of efficient experimental designs under multiple resource constraints, A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design, Optimal block designs with minimal number of observations, Optimal incomplete-block designs with low replication: a unified approach using graphs, Maximal determinant over a certain class of matrices and its application to D-optimality of designs

Cites Work

• Some classes of optimality criteria and optimal designs for complete two- way layouts
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Optimality of certain asymmetrical experimental designs
• Connected graphs with a minimal number of spanning trees
• Parallel concepts in graph theory
• A certain polynomial of a graph and graphs with an extremal number of trees
• Maximizing the number of spanning trees in a graph with n nodes and m edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item