On the optimality of block designs

zbMath0588.62123MaRDI QIDQ1073512

Gregory M. Constantine

Publication date: 1986

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvalueD-optimalityspanning treeA-optimalityE-optimalityline graphpositive definite matrixcounterexamplesAsymptotic behaviorE-criterionequivalence of the A- and D- criteriaregular graph designs

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Statistical block designs (62K10)

Related Items

Graph complexity and the laplacian matrix in blocked experiments ⋮ Regular graph designs ⋮ A family of resolvable regular graph designs ⋮ Graphs, networks, and linear unbiased estimates ⋮ Optimal regular graph designs ⋮ Laplace eigenvalues of graphs---a survey ⋮ A note on the E-optimality of regular line graph designs ⋮ Optimality and construction of some rectangular designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On spectral characterization and embeddings of graphs
• On the efficiency of regular generalized line graph designs
• Line graphs, root systems, and elliptic geometry
• Circuits and efficiency in incomplete block designs
• Do nearly balanced multigraphs have more spanning trees?