Please use this identifier to cite or link to this item:
Title: Group divisible designs with two associate classes and with two unequal groups
Authors: Pabhapote, N. 
Keywords: Graph decomposition;Group divisible design
Issue Date: 2012
Publisher: Scopus
University of the Thai Chamber of Commerce
Source: N. Pabhapote (2012) Group divisible designs with two associate classes and with two unequal groups. International Journal of Pure and Applied Mathematics Vol.81 No.1, 191-198.
Abstract: A group divisible design GDD(m, n; 3, λ 1, λ 2) is an ordered triple (V,G,B), where V is a m + nset of symbols, G is a partition of V into 2 sets of sizes m, n, each set being called group, and B is a collection of 3subsets(called blocks) of V , such that each pair of symbols from the same group occurs in exactly λ 1 blocks; and each pair of symbols from different groups occurs in exactly λ 2 blocks. In this paper, we find necessary and sufficient conditions for the existence of a GDD(m, n; 3, λ 1, λ 2) with λ 1 ≥ λ 2.
Rights: This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.
Appears in Collections:RSO: Journal Articles

Files in This Item:
File Description SizeFormat 
99.pdf116.9 kBAdobe PDFThumbnail
Show full item record Recommend this item

Page view(s)

checked on Jul 11, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.