On the efficiency of regular generalized line graph designs

DOI10.1016/0378-3758(86)90080-7zbMath0611.62097MaRDI QIDQ1087282

Ching-Shui Cheng, Gregory M. Constantine

Publication date: 1986

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(86)90080-7

zbMATH Keywords

balanced incomplete block designs; group-divisible designs; regular graph designs; E- optimal; regular generalized line graph design; triangular designs

Mathematics Subject Classification ID

62K05: Optimal statistical designs

05B05: Combinatorial aspects of block designs

62K10: Statistical block designs

Related Items

Some series of rectangular designs, Strongly linear trend-free block designs and 1-factors of representative graphs, On the optimality of block designs, Some optimal designs of block size two, Optimality and construction of some rectangular designs, Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs

Cites Work

• On spectral characterization and embeddings of graphs
• On the comparison of PBIB designs with two associate classes
• On the E-optimality of PBIB designs with a small number of blocks
• Orbits under actions of affine groups over GF(2)
• Line graphs, root systems, and elliptic geometry
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• Optimality of certain asymmetrical experimental designs
• Strongly regular graphs, partial geometries and partially balanced designs
• On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
• An upper bound for the minimum canonical efficiency factor of incomplete block designs
• Circuits and efficiency in incomplete block designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item