双竞赛图的得分序列
Score sequences of bitournaments
AI总结：
本文针对双竞赛图得分序列的刻画问题，引入序列修剪的新概念，给出了双竞赛图得分序列的一种新刻画方法，丰富了该领域的相关研究成果。
摘要：
有向图中顶点$x$的得分定义为其出度，即以$x$为始点的弧的数量。有向图的得分序列是按非降序排列的所有得分构成的序列。有向完全二部图被称为bitournament（双竞赛图）。双竞赛图的得分序列由两个非降非负整数序列组成，分别对应两个部集的顶点。Moon已对双竞赛图的得分序列进行了刻画。本文引入了序列修剪的概念，并利用该概念给出了双竞赛图得分序列的一种刻画。
英文摘要：
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order. An oriented complete bipartite graph is called a bitournament. The score sequence of a bitournament consists of two nondecreasing sequences of nonnegative integers, one for each of the two partite sets. Moon has characterized the score sequences of bitournaments. This paper introduces the concept of trimming a sequence and gives a characterization of score sequences of bitournaments utilizing this concept.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
