Results 241 to 250 of about 2,511 (267)

A method of construction of regular group divisible designs

Biometrika, 1987
A method of construction of regular group divisible designs is described, which leads to two new designs.
openaire   +2 more sources

Signings of group divisible designs and projective planes [PDF]

Australas. J Comb., 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter B. Gibbons, Rudolf Mathon
openaire   +1 more source

On Group Divisible Rotatable Designs

Calcutta Statistical Association Bulletin, 1976
Adhikary, Basudeb, Sinha, Bikas Kumar
openaire   +2 more sources

Group divisible designs with large block sizes

Designs, Codes and Cryptography, 2017
In this paper, the author showed that there is a \((k,\lambda_k)\)-GDD, group divisible design, of type \((q^{l+1}-q^l)^{(q^{n-l}-1)/(q-1)}\), for any prime power \(q\) and any integers \(k\), \(n\) with \(3\leq k \leq n\), where \(\lambda_k=\frac{\prod_{i=3}^{k-1}(q^n-q^{l+i-1})}{(k-2)!}\) and \(k+l\leq n+1\).
openaire   +2 more sources

New Constructions of Divisible Design Cayley Graphs

Graphs and Combinatorics, 2021
Dean Crnković, Andrea Svob, Crnković Dean   +2 more
exaly  

Classification of divisible design graphs with at most 39 vertices

Journal of Combinatorial Designs, 2022
Dmitry Panasenko, Leonid Shalaginov
exaly  

Matrix constructions of family (A) group divisible designs [PDF]

Australas. J Comb., 1995
A new construction of (not necessarily symmetric) group divisible designs (GDD) with \(b= 4(r- \lambda_2)\) is described (\(b\) denotes the number of blocks of the design, and \(\lambda_2\) the number of blocks through two points in different point classes; \(r\) is the number of blocks through a point). GDDs with this property are called ``family (A)''
openaire   +1 more source

New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs

Discrete Mathematics, 2022
V V Kabanov
exaly  

On Generalised Group Divisible Designs

Calcutta Statistical Association Bulletin, 1973
openaire   +2 more sources

Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique

Designs, Codes, and Cryptography, 2023
Alexander L Gavrilyuk, V V Kabanov
exaly