Premium
Connectedness of PBIB designs
Author(s) -
Baksalary Jerzy K.,
Tabis Ze
Publication year - 1987
Publication title -
canadian journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.804
H-Index - 51
eISSN - 1708-945X
pISSN - 0319-5724
DOI - 10.2307/3315203
Subject(s) - social connectedness , class (philosophy) , context (archaeology) , mathematics , computer science , combinatorics , psychology , biology , social psychology , artificial intelligence , paleontology
A necessary and sufficient condition for the connectedness of an m ‐associate‐class PBIB design is derived in a form, and using an approach, different from those in Ogawa, Ikeda, and Kageyama (1984) and Saha and Kageyama (1984). The applicability of this condition is shown in the context of group‐divisible m ‐associate‐class PBIB designs.