A family of resolvable regular graph designs

Authors

Donald L. Kreher, Michigan Technological UniversityFollow
Gordon F. Royle, University of Western Australia
W. D. Wallis, Southern Illinois University at Carbondale

Document Type

Article

Publication Date

9-1996

Department

Department of Mathematical Sciences

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 λ₁ or λ₁ + 1 common blocks, for some constant λ₁. We investigate resolvable regular graph designs with block size 4. In particular we determine the parameters for which such designs exist, for v ≤ 16.

Publisher's Statement

© 1996

Publication Title

Discrete Mathematics

Recommended Citation

Kreher, D. L., Royle, G., & Wallis, W. (1996). A family of resolvable regular graph designs. Discrete Mathematics, 156(1-3), 269-275. http://doi.org/10.1016/0012-365X(95)00052-X
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/5244