On Regular Generalized Line Graph Designs.
Abstract
A class of efficient designs called regular generalized line graph designs are introduced. This class of designs includes many well-known optimum and efficient designs, e.g., balanced incomplete block designs, group-divisible designs with lambda 2 equal lambda 1 + 1, group-divisible designs with lambda 1 equal lambda 2 + 1 and group size two, triangular designs with lambda 2 equal lambda 1 + 1, L2 designs with lambda 2 equal lambda 1 + 1, etc. The optimality of regular generalized line graph designs is investigated. This uses graph theory as a tool and unifies much of the previous work in the area. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1982
- Accession Number
- ADA114576
Entities
People
- Ching-shui Cheng
- Gregory M. Constantine
Organizations
- University of Wisconsin–Madison