semicomplete

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.

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