Results 1 to 10 of about 36,190 (171)
A new regular group divisible design
A regular group divisible design with parameters: v=b=39, r=k=9, λ1=0, λ2=2, m=13, n=3is obtained using balanced generalized Weighing matrix over a dihedral group of order 6.
Shyam Saurabh, Kishore Sinha
doaj +4 more sources
q-analogs of group divisible designs [PDF]
A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs.
Buratti, Marco +4 more
core +4 more sources
Existence of a new class of group divisible designs with block size four
Group divisible designs are not only kinds of classical designs in combinatorial design theory, but also have extremely important applications in coding theory.
TANG Jiahao WANG Jinhua
doaj +1 more source
Genetic susceptibility to multiple sclerosis in African Americans
Objective To explore the nature of genetic-susceptibility to multiple sclerosis (MS) in African-Americans. Background Recently, the number of genetic-associations with MS has exploded although the MS-associations of specific haplotypes within the major ...
Douglas S. Goodin +4 more
doaj +2 more sources
Partially balanced network designs and graph codes generation
Partial balanced incomplete block designs have a wide range of applications in many areas. Such designs provide advantages over fully balanced incomplete block designs as they allow for designs with a low number of blocks and different associations. This
A. El-Mesady +3 more
doaj +1 more source
3-Group Divisible Designs with 3 Groups and Block Size 5
A 3-GDD (n, 2, k, λ1, λ2) was defined by combining the definitions of a group divisible design and a t-design. In this paper, we extend the definitions to 3 groups and block size 5, and we denote such GDD by 3-GDD (n, 3, 5, μ1, μ2).
Zebene Girma Tefera +2 more
doaj +1 more source
Designs for graphs with six vertices and ten edges
The design spectrum has been determined for two of the 15 graphs with six vertices and ten edges. In this paper we completely solve the design spectrum problem for a further eight of these graphs.
A. D. Forbes, T. S. Griggs, K. A. Forbes
doaj +1 more source
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs [PDF]
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds.
Danziger, Peter, Stevens, Brett
openaire +2 more sources
Regular A-optimal Spring Balance Weighing Designs
The problem of indicating an A-optimal spring balance weighing design providing that the measurement errors have different variances and are uncorrelated is considered.
Małgorzata Graczyk
doaj +1 more source
Highly D‑efficient Weighing Design and Its Construction
In this paper, some aspects of design optimality on the basis of spring balance weighing designs are considered. The properties of D‑optimal and D‑efficiency designs are studied.
Bronisław Ceranka, Małgorzata Graczyk
doaj +1 more source

