TY - JOUR

T1 - A family of resolvable regular graph designs

AU - Kreher, D.L.

AU - Royle, Gordon

AU - Wallis, W.D.

PY - 1996

Y1 - 1996

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

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

U2 - 10.1016/0012-365X(95)00052-X

DO - 10.1016/0012-365X(95)00052-X

M3 - Article

VL - 156

SP - 269

EP - 275

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

ER -