摘要
提出了求K2n的△(G)个完备匹配Mi的一种算法。给出了循环赛图的定义。阐明了循环赛图K2n(i)的构造的过程。介绍了循环赛图K(8i),K(1i0),K(1i)4,K(1i)6的构造结果。
A method of determining △(G)perfect matchings of a complete graph is proposed.The definition about round-robin tournament graph is given.The procedure of constructing round-robin tournaments is described.The constructed results of round-robin tournamentsK(?),K(?),K(?),K(?) are presented.
出处
《井冈山大学学报（自然科学版）》
2006年第4期5-7,共3页
Journal of Jinggangshan University (Natural Science)
关键词
循环赛图
完备匹配
算法
完全图
构造
Round-robin tournament
Perfect matching
Algorithm
Complete graph
Construction
