Let Kv be the complete graph with v vertices and G be a finite simple graph.
设K_v是一个v点完全图。 G是一个有限简单图。
参考来源 - 完备图K·2,447,543篇论文数据，部分数据来源于NoteExpress
An orientation of a complete graph is called a tournament.
完全图的定向图称为竞赛图。
Up to isomorphism, there is just one complete graph on vertices.
在同构意义下， 几个顶点的完全图只有一个。
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 complete graph is put forward.
研究了任意N阶k正则简单图的生成法则，提出了由简单完全图递归生成任意N阶k正则图的方法。
应用推荐