Connectedness of Kronecker sum and partial Kronecker row sum of designs
In this paper we discuss connectedness of a design which is a Kronecker sum or a partial Kronecker row sum of any two equi-replicate and equi-block size designs.
Year of publication: |
1984
|
---|---|
Authors: | Dandawate, P. N. ; Patwardhan, G. A. ; Vartak, M. N. |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 2.1984, 6, p. 315-317
|
Publisher: |
Elsevier |
Keywords: | Kronecker sum partial Kronecker sum connectedness balanced designs |
Saved in:
Saved in favorites
Similar items by person
-
The three-dimensional bottleneck assignment problem with capacity constraints
Geetha, S., (1994)
-
Time-cost tradeoff in a three dimensional assignment problem
Geetha, S., (1989)
-
A combinatorial theorem for a class of residual treatment effects designs
Mashouri, Gh., (1993)
- More ...