On the efficiency of regular generalized line graph designs (Q1087282): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Gregory M. Constantine / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Kishore Sinha / rank | |||
Normal rank | |||
Revision as of 11:38, 17 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the efficiency of regular generalized line graph designs |
scientific article |
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
