对集不交的循环赛图K^(i)_(11)与对集的算法

Round-robin tournaments and duplet sets algorithm

给出了边矩阵和循环赛图的定义。提出了求解完全图K2n+1的△(G)+1个对集Ei的算法,以及对集互交的循环赛图K(1)11,K(2)11,…,K(i)11的构造方法。讨论任意对集Ei及循环图K(i)2n+1的个数问题。介绍了14个对集不交的循环赛图K(11),K(121),…,K(14)11的构造过程。

The definitions about edge matrix and round-robin tournament are given.An slgorithm of determining duplet sets of the complete graph and a method of constructing round-robin tournaments without duplet sets in common are proposed.The emuration problem of any duplet set and round-robin tournament is discussed.The construction procedure of round-robin tournaments without duplet sets in common is presented.