A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of two mutually opposite arcs.

摘要 用一条弧或一相反的弧代替完全多部无的每一条所得到的有被称为是半完全多部有。

The kings prblems in semicomplete digraphs without vertices whose in-degree are zero and locally semicomplete digraph under some conditions are discussed chiefly in the paper.

中,主要讨论了不包含内度为零的顶点的半完全有和满足若干条件下的局部半完全有中王的问题。