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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''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.

Текущая версия от 10:48, 24 октября 2018

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.