Complete graph

Complete graph — полный граф.

A graph for which every pair of distinct vertices defines an edge is called a complete graph. The complete graph with [math]\displaystyle{ \,n }[/math] vertices is denoted by [math]\displaystyle{ \,K_{n} }[/math].

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.