Graphs with the n-e.c. adjacency property constructed from resolvable designs
✍ Scribed by Catharine A. Baker; Anthony Bonato; Neil A. McKay; Paweł Prałat
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 144 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Only recently have techniques been introduced that apply design theory to construct graphs with the n‐e.c. adjacency property. We supply a new random construction for generating infinite families of finite regular n‐e.c. graphs derived from certain resolvable Steiner 2‐designs. We supply an extension of our construction to the infinite case, and thereby give a new representation of the infinite random graph. We describe a family of deterministic graphs in infinite affine planes which satisfy the 3‐e.c. property. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 294–306, 2009