Add to ORKGAbstract: In this paper, we obtain PBIB designs with association schemes which are arising from the minimum dominating sets of (C3°K1), (C4°K1) and (C5°K1), then we generalize the results to the graph (Cn ° K1). Further we generalize the result to (Cn ° Km) and (G°Km)
designs, which are called Partially Balanced Incomplete Block (PBIB) designs. In these designs the v...
AbstractSymmetric association schemes having a parabolic of rank 3 and corank 2 satisfying a certain...
AbstractPartitions on a set are partially ordered by nesting: partition F is nested in partition G i...
In this paper we disprove a result on the PBIB designs arising from γbc-sets in Q4, with m = 4 asso...
In this paper, we determine the partially balanced incomplete block designs and association scheme w...
A dominating set D of a connected graph G=(V,E) is said to be bi-connected dominating set if the ...
Let G = (V, E) be a graph. The smallest number of edges in any edge cover of and is called its edge ...
The present paper gives an introduction to the theory of association schemes, following Bose-Mesner ...
The present paper gives an introduction to the theory of association schemes, following Bose-Mesner ...
SUMMARY. This paper presents a necessary and sufficient condition for connectedness of a class of PB...
An association scheme partitions a finite set \Omega into symmetric subsets, one of which is the dia...
In an m-class partially balanced incomplete block (PBIB) design [3], any two distinct treatments are...
AbstractThis paper presents series of PBIB designs with m associate classes in which the treatment s...
AbstractA necessary and sufficient condition is given for the partition of a finite group to define ...
In an m-class partially balanced incomplete block (PBIB) design [3], any two distinct treatments are...
designs, which are called Partially Balanced Incomplete Block (PBIB) designs. In these designs the v...
AbstractSymmetric association schemes having a parabolic of rank 3 and corank 2 satisfying a certain...
AbstractPartitions on a set are partially ordered by nesting: partition F is nested in partition G i...
In this paper we disprove a result on the PBIB designs arising from γbc-sets in Q4, with m = 4 asso...
In this paper, we determine the partially balanced incomplete block designs and association scheme w...
A dominating set D of a connected graph G=(V,E) is said to be bi-connected dominating set if the ...
Let G = (V, E) be a graph. The smallest number of edges in any edge cover of and is called its edge ...
The present paper gives an introduction to the theory of association schemes, following Bose-Mesner ...
The present paper gives an introduction to the theory of association schemes, following Bose-Mesner ...
SUMMARY. This paper presents a necessary and sufficient condition for connectedness of a class of PB...
An association scheme partitions a finite set \Omega into symmetric subsets, one of which is the dia...
In an m-class partially balanced incomplete block (PBIB) design [3], any two distinct treatments are...
AbstractThis paper presents series of PBIB designs with m associate classes in which the treatment s...
AbstractA necessary and sufficient condition is given for the partition of a finite group to define ...
In an m-class partially balanced incomplete block (PBIB) design [3], any two distinct treatments are...
designs, which are called Partially Balanced Incomplete Block (PBIB) designs. In these designs the v...
AbstractSymmetric association schemes having a parabolic of rank 3 and corank 2 satisfying a certain...
AbstractPartitions on a set are partially ordered by nesting: partition F is nested in partition G i...