摘要
本文考虑以允许平局的单循环比赛为模型的２－竞赛图（二重完全图的定向图）和它的邻接矩阵（２－竞赛矩阵）得到了得分向量与２－圈数，３－圈数之间的关系；给出了构造最省和最奢的２－竞赛矩阵的方法；部分地回答了文献［４］中的一个问题．
In this paper we extend some concepts of tournaments to 2-tournaments, give conditions for an arbitrary nonegative integers vector to be score vector, obtain the relation among the number of 3-cycles, 2-cycles of a 2-tournament and its score vector a, and obtain the maximum and minimum number of 2-cycles with prescribed score vector s, partly answer a open problem of [4].
出处
《应用数学学报》
CSCD
北大核心
2001年第4期533-538,共6页
Acta Mathematicae Applicatae Sinica
基金
国家自然科学基金(19971086号)资助项目。
