边矩阵K′_(2n+1)的K+1-边着色与循环赛的安排

Round-robin tournament arrangement and K+1-edge colouring of the edge mafpix K′_(2n+1)

为了让一个2n+1阶的完全图K2n+1变成一个可用于循环赛安排的循环赛图K(2in)+1,给出了边矩阵和循环赛图的定义。提出了利用边矩阵K′2n+1的K+1-边处色求解完全图K2n+1的K+1个完备匹配的Mi的算法。介绍了循环赛图K(1i3),K(1i5),…,K(3i2)的构造结果及其应用。

To make that a complete graph K2n＋1 become useful for round-robin yournameny arrangemeny, the definitions about edge motrix and round-robin tournament are given an algorithm for determining K＋ 1 pefect matchings of a complete graph K2n＋1 by using K＋1-edge colouring of edge matric K′2n＋1 is ppoposed. The constructed results and the aplications of round-robin tournaments K13^（i）,K15^（i）,…,K32^（i） are ppesented.