Complete graph — различия между версиями
Материал из WikiGrapp
Glk (обсуждение | вклад) (Новая страница: «'''Complete graph''' --- полный граф. A graph for which every pair of distinct vertices defines an edge is called a '''complete graph'''. The complete gr…») |
KEV (обсуждение | вклад) |
||
| Строка 1: | Строка 1: | ||
| − | '''Complete graph''' | + | '''Complete graph''' — ''[[полный граф]].'' |
| − | A graph for which every pair of distinct vertices defines an edge is | + | 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>. |
| − | called a '''complete graph'''. The complete graph with <math>n</math> vertices is | + | |
| − | denoted by <math>K_{n}</math>. | + | ==Литература== |
| + | |||
| + | * Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | ||
Текущая версия на 13:16, 10 ноября 2014
Complete graph — полный граф.
A graph for which every pair of distinct vertices defines an edge is called a complete graph. The complete graph with 
vertices is denoted by 
.
Литература
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.
