𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Resolving and strictly resolving regularizers

✍ Scribed by V. M. Kadets; M. I. Kadets; V. P. Fonf


Publisher
SP MAIK Nauka/Interperiodica
Year
1989
Tongue
English
Weight
408 KB
Volume
29
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A family of resolvable regular graph des
✍ Donald L. Kreher; Gordon F. Royle; W.D. Wallis πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 278 KB

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 21 + 1 common blocks, for some constant 2~. We investigate resolvable regular graph designs with block size 4. In particular we deter