Matrix constructions of family (A) group divisible designs
نویسنده
چکیده
In this note we use matrices to construct group divisible designs (GDDs). The constructions of GDDs of the form A 0 D + A ® D will be carried out in two cases. The first case uses the incidence matrix D of a GDD with a certain (0,1) matrix A. The second case uses the incidence matrix D of a BIBD with A as in the first case. In both cases necessary and sufficient conditions in terms of parameters of A and D are derived for N to be the incidence matrix of a GDD. This construction yields besides regular also semi-regular and singular family(A) GDDs. Moreover, this construction produces also some known GDDs constructed earlier by several authors.
منابع مشابه
Variations on the McFarland and Spence constructions of difference sets
We give two new constructions of symmetric group divisible designs using divisible difference sets. These constructions generalize the McFarland and Spence constructions of symmetric designs. Divisible designs are of interest in several parts of mathematics: The design theorist needs classes of divisible designs as "ingredients" for recursive constructions of designs. Statisticians use divisibl...
متن کاملFurther results on large sets of disjoint group-divisible designs
Chen, D., CC. Lindner and D.R. Stinson, Further results on large sets of disjoint group-divisible designs, Discrete Mathematics 110 (1992) 35-42. This paper is a continuation of a recent paper by Chen and Stinson, where some recursive constructions for large sets of group-divisible design with block size 3 arc presented. In this paper, we give two new recursive constructions. In particular, we ...
متن کاملClass-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
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. We present some general constructions including a novel construction for shrinking the index of a master de...
متن کاملDivisible design graphs
A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a divisible design. Divisible design graphs are a natural generalization of (v, k, λ)-graphs, and like (v, k, λ)-graphs they make a link between combinatorial design theory and algebraic graph theory. The study of divisible design graphs benefits from, and contributes to, both parts. Using information of the e...
متن کاملNew constructions of divisible designs
261 Davis, J.A., New constructions of divisible designs, Discrete Mathematics 120 (1993) 261-268. A construction is given for a (p2"(p+l),p,p2"+ 1(p+l),p2"+ ,p"(p+l)) (pa prime) divisible difference set in the group H x z~.+, where His any abelian group of order p+ 1. This can be used to generate a symmetric semi-regular divisible design; this is a new set of parameters for .l. 1 ;<'0, and thos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 11 شماره
صفحات -
تاریخ انتشار 1995