摘要
一个参数为n,k,λ的匹配设计,记为MATCH(n,k,λ)设计,是完全图K_n的一个k一匹配集合,满足条件:K_n的任意一对独立边恰好出现在其中λ个k一匹配中.本文指出一个MATCH(n,k,λ)设计等价于一个参数λ_1=0,λ_2=λ的三角形设计,给出若干构造匹配设计的新方法.
A MATCH (n, k,λ)-design is a collection of k-matchings of the complete graph K_n with every pair of independent edges lying exactly in λ members of the collection.In this paper it is pointed out that a MATCH(n,k,λ)-design turns to be a trian-gular design with parametersλ_1 = 0, λ_2 =λ; and some new methods are also given to construct matching designs.
出处
《长沙铁道学院学报》
CSCD
1992年第3期85-89,共5页
Journal of Changsha Railway University
关键词
匹配设计
完全图
1-因子
Matching design, Complete graph, 1-factor
