Regular graph designs
From MaRDI portal
Publication:1918205
DOI10.1016/0378-3758(95)00091-7zbMath0847.62066OpenAlexW2053015727MaRDI QIDQ1918205
Publication date: 18 July 1996
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(95)00091-7
Related Items (3)
MBMUDs: A combinatorial extension of BIBDs showing good optimality behaviour ⋮ Generalized neighbor designs with block size 3 ⋮ Construction of neighbor designs of block size 4 for all values of v ≥ 5 by using the method of addition
Cites Work
- On the optimality of block designs
- Nonexistence of a regular graph design with \(v=17\) and \(k=6\)
- Quasi-symmetric designs and biplanes of characteristic three
- Optimality of experimental designs
- On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
- A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNS
- Bounds for the efficiency factor of block designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Regular graph designs