A family of resolvable regular graph designs

A regular graph design RGD(v,k;r) is a design on v 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 determ...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics 1996-09, Vol.156 (1), p.269-275
Main Authors: Kreher, Donald L., Royle, Gordon F., Wallis, W.D.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A regular graph design RGD(v,k;r) is a design on v 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 v⩽ 16.
ISSN:0012-365X
1872-681X
DOI:10.1016/0012-365X(95)00052-X