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.

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