𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A family of resolvable regular graph designs

✍ Scribed by Donald L. Kreher; Gordon F. Royle; W.D. Wallis

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
278 KB
Volume
156
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 determine the parameters for which such designs exist, for v ~< 16.

πŸ“œ SIMILAR VOLUMES

Families of Regular Graphs in Regular Ma
Families of Regular Graphs in Regular Maps
✍ Steve Wilson πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 227 KB

The question of when a given graph can be the underlying graph of a regular map has roots a hundred years old and is currently the object of several threads of research. This paper outlines this topic briefly and proves that a product of graphs which have regular embeddings also has such an embeddin

New families of strongly regular graphs
New families of strongly regular graphs
✍ Yury J. Ionin; Hadi Kharaghani πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208–217, 2003; Published online in Wiley InterScience (www.interscience.wil

A construction of resolvable nested 3-de
A construction of resolvable nested 3-designs
✍ Shivani Rai; Shakti Banerjee; Sanpei Kageyama πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 83 KB

## Abstract A method of constructing resolvable nested 3‐designs from an affine resolvable 3‐design is proposed with one example. Β© 2004 Wiley Periodicals, Inc.