On the efficiency of regular generalized line graph designs (Q1087282)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the efficiency of regular generalized line graph designs |
scientific article; zbMATH DE number 3988535
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the efficiency of regular generalized line graph designs |
scientific article; zbMATH DE number 3988535 |
Statements
On the efficiency of regular generalized line graph designs (English)
0 references
1986
0 references
A subclass of the class of regular graph designs [see \textit{J. A. John} and \textit{T. J. Mitchell}, J. R. Stat. Soc., Ser. B 39, 39-43 (1977; Zbl 0354.05015)] called regular generalized line graph design has been introduced. The designs are usually E-optimal and include many well known optimal and efficient designs. The optimality of regular generalized line graph designs has been investigated using graph theoretic results.
0 references
balanced incomplete block designs
0 references
group-divisible designs
0 references
triangular designs
0 references
regular graph designs
0 references
regular generalized line graph design
0 references
E- optimal
0 references
