Bondy--Chvtal closure operation: различия между версиями

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Bondy--Chv\'{a}tal closure operation''' --- операция замыкания Бонди-Хватала. Given a graph of order <math>n</math>, repeat the fo…»)
 
Нет описания правки
Строка 7: Строка 7:
the resulting graph and call it the '''Bondy--Chv\'{a'''tal closure} of
the resulting graph and call it the '''Bondy--Chv\'{a'''tal closure} of
<math>G</math>.
<math>G</math>.
The other name is '''Hamiltonian closure'''.

Версия от 12:36, 24 февраля 2011

Bondy--Chv\'{a}tal closure operation --- операция замыкания Бонди-Хватала.

Given a graph of order [math]\displaystyle{ n }[/math], repeat the following operation as long as possible. For each pair of nonadjacent vertices [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math], if [math]\displaystyle{ d(a) + d(b) \geq n }[/math], then add the edge [math]\displaystyle{ ab }[/math] to [math]\displaystyle{ G }[/math]. We denote by [math]\displaystyle{ cl(G) }[/math] the resulting graph and call it the Bondy--Chv\'{atal closure} of [math]\displaystyle{ G }[/math].

The other name is Hamiltonian closure.