Complete graph: различия между версиями

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

A [[graph, undirected graph, nonoriented graph| graph]] for which every pair of distinct [[vertex|vertices]] defines an [[edge]] is called a '''complete graph'''. The complete graph with <math>\,n</math> vertices is denoted by <math>\,K_{n}</math>.

 

 

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