๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Constructions of Pairwise-and Variance-Balanced Designs

โœ Scribed by Sinha, Kishore; Jones, Byron; Kageyama, Sanpei

Book ID
126760586
Publisher
Taylor and Francis Group
Year
1997
Tongue
English
Weight
597 KB
Volume
29
Category
Article
ISSN
0233-1888

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Embeddability and construction of affine
Embeddability and construction of affine ฮฑ-resolvable pairwise balanced designs
โœ Boris Bekker; Yury J. Ionin; Mohan S. Shrikhande ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 315 KB ๐Ÿ‘ 1 views

An affine ฮฑ-resolvable PBD of index ฮป is a triple (V, B, R), where V is a set (of points), B is a collection of subsets of V (blocks), and R is a partition of B (resolution), satisfying the following conditions: (i) any two points occur together in ฮป blocks, (ii) any point occurs in ฮฑ blocks of each