摘要
给出了边矩阵和循环赛图的定义.为K2n+1的2n+1个对集的划分,提出了完全图K2n+1或边矩阵K′2n+1的Δ(G)+1-边着色法和平行线法.为K2n的2n个完备匹配的划分,提出了顶点序号的排序法.介绍了循环赛图的构造过程.讨论了循环赛图及完备匹配的计数问题.
The definitons about edge matrix and round-robin tournament are given. To partition K2n＋1 into 2n＋1 duplet sets the method of A（G）＋l-edge colouring the complete graph K2n＋1 on edge matrix K′2n＋1 ,and the method of parallel are proposed. To partition K2n into 2n pertect matchings the method sequencing the vertices ordinal number is proposed. The entire construction procedure of the round-robin tournamenfs is presented. The enumeration problem of round-robin tournaments and perfect rnatchings are discussed.
出处
《西安工业大学学报》
CAS
2008年第2期172-175,共4页
Journal of Xi’an Technological University
关键词
循环赛图
完备匹配
边矩阵
完全图
round-robin tournaments
perfect matching
edge matrix
complete graph
