Title

A family of resolvable regular graph designs

Document Type

Article

Publication Date

9-1-1996

Abstract

A regular graph design RGD(υ, k; r) is a design on υ points with blocks of size k and constant replication number r, such that any two points belong to either λ1 or λ1 + 1 common blocks, for some constant λ1. We investigate resolvable regular graph designs with block size 4. In particular we determine the parameters for which such designs exist, for υ ≤ 16.

Publication Title

Discrete Mathematics

Share

COinS