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

Материал из WikiGrapp
Перейти к:навигация, поиск
(Новая страница: «'''Complete graph''' --- полный граф. A graph for which every pair of distinct vertices defines an edge is called a '''complete graph'''. The complete gr…»)
 
 
Строка 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 \,n vertices is denoted by \,K_{n}.

Литература

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