度为 1 的点称为叶子点(leaf) 所有顶点度都为 k k 12 V 1 的简单图被称为 k 阶正则图(k-regular graph) 。特别地,若图的各顶点的度均等于 V 1 ,即任意一顶点都和其他顶点相邻,则称此图为完全图(complete graph),具有 n 个顶点的...
双语例句
1
The generative rule of arbitrary N-rank K-regular simple graph is studied, and the method of recursively generating arbitrary N-rank K-regulargraph from the simple complete graph is put forward.