Regular graph designs
From MaRDI portal
Recommendations
Cites work
- A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNS
- Bounds for the efficiency factor of block designs
- scientific article; zbMATH DE number 4151650 (Why is no real title available?)
- scientific article; zbMATH DE number 3176492 (Why is no real title available?)
- scientific article; zbMATH DE number 3664952 (Why is no real title available?)
- scientific article; zbMATH DE number 3675163 (Why is no real title available?)
- scientific article; zbMATH DE number 3692486 (Why is no real title available?)
- scientific article; zbMATH DE number 3550719 (Why is no real title available?)
- scientific article; zbMATH DE number 3074517 (Why is no real title available?)
- Nonexistence of a regular graph design with \(v=17\) and \(k=6\)
- On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
- On the optimality of block designs
- Optimality of experimental designs
- Quasi-symmetric designs and biplanes of characteristic three
Cited in
(12)- Some sufficient conditions for the type 1 optimality of block designs
- On the efficiency of regular generalized line graph designs
- Nonexistence of a regular graph design with \(v=17\) and \(k=6\)
- Some sufficient conditions for type 1 optimality with applications to regular graph designs
- Optimal regular graph designs
- MBMUDs: A combinatorial extension of BIBDs showing good optimality behaviour
- A new class of E-optimal regular graph designs
- scientific article; zbMATH DE number 94782 (Why is no real title available?)
- scientific article; zbMATH DE number 782055 (Why is no real title available?)
- Construction of neighbor designs of block size 4 for all values of v 5 by using the method of addition
- Generalized neighbor designs with block size 3
- A construction for regular-graph designs
This page was built for publication: Regular graph designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918205)