| 释义 |
complete graph 完全图 A graph G in which there is an edge joining every pair of distinct vertices; every vertex is adjacent to every other vertex. If G contains n vertices then the number of edges in n(n-1)/2. 一种每两个顶点都有一条边相连的图,图中每个顶点和其它每个顶点都相邻接。若图G中含n 个顶点,则边的总数为n(n-1)/2。 |