𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On block designs arising from rank 3 graphs

✍ Scribed by V.D. Tonchev

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
663 KB
Volume
5
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Spectra of Certain Graphs Arising
On the Spectra of Certain Graphs Arising from Finite Fields
✍ Nancy Tufts Allen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 560 KB

Cayley graphs on a subgroup of GΒΈ(3, p), p'3 a prime, are defined and their properties, particularly their spectra, studied. It is shown that these graphs are connected, vertex-transitive, nonbipartite, and regular, and their degrees are computed. The eigenvalues of the corresponding adjacency matri

Comments on 3-blocked designs
Comments on 3-blocked designs
✍ Harold N. Ward πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

## Abstract This note provides a correction and some additions to a 1999 article by Luigia Berardi and Fulvio Zuanni on blocking 3‐sets in designs. Β© 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 328–331, 2012

A note on 3-blocked designs
A note on 3-blocked designs
✍ Luigia Berardi πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 145 KB πŸ‘ 2 views

A blocking set of a design different from a 2-(Ξ»+ 2, Ξ»+ 1, Ξ») design has at least 3 points. The aim of this note is to establish which 2-(v, k, Ξ» ) designs D with r β‰₯ 2Ξ» may contain a blocking 3-set. The main results are the following. If D contains a blocking 3-set, then D is one of the following d