✦ LIBER ✦

Coloured designs, new group divisible designs and pairwise balanced designs

✍ Scribed by C.A. Rodger; Dinesh G. Sarvate; Jennifer Seberry

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 507 KB
Volume: 15
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(86)90110-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

D-optimal designs and group divisible de

D-optimal designs and group divisible designs

✍ Hiroki Tamura 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract We obtain new conditions on the existence of a square matrix whose Gram matrix has a block structure with certain properties, including D‐optimal designs of order $n\equiv 3 \pmod 4$, and investigate relations to group divisible designs. We also find a matrix with large determinant for

Some new group divisible designs

✍ J.A. John; G. Turner 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Some new group divisible designs

✍ Bhagwandas; J.S. Parihar 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Nested group divisible designs and small

Nested group divisible designs and small nested designs

✍ Judith Q. Longyear 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 364 KB

New constructions of group divisible des

New constructions of group divisible designs

✍ K.T. Arasu; Susan Harris 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Minimal clique partitions and pairwise b

Minimal clique partitions and pairwise balanced designs

✍ Rolf Rees 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

We consider the problem of determining cp(G v KC), the smallest number of cliques required to partition the edge set of the graph G v K~, where G is a finite simple graph and K~, is the empty graph on m vertices. A lower bound on cp(G v K~,,,) is obtained which, when applied to the case G = K,, shar