An orientation of a completegraph is called a tournament.
完全图的定向图称为竞赛图。
2
Up to isomorphism, there is just one completegraph on vertices.
在同构意义下， 几个顶点的完全图只有一个。
3
The generative rule of arbitrary N-rank K-regular simple graph is studied, and the method of recursively generating arbitrary N-rank K-regular graph from the simple completegraph is put forward.