Аноним

Circular clique number: различия между версиями

Материал из WEGA
нет описания правки
(Новая страница: «'''Circular clique number''' --- цикловое кликовое число. The '''circular clique number''' of a graph <math>G</math>, denoted by <math>\omega_…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Circular clique number''' --- цикловое кликовое число.  
'''Circular clique number''' — ''[[цикловое кликовое число]].''


The '''circular clique number''' of a graph <math>G</math>, denoted by <math>\omega_{c}(G)</math>,
The '''circular clique number''' of a [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math>, denoted by <math>\,\omega_{c}(G)</math>,
is defined as the maximum quotient <math>k/d</math> such that the graph <math>G_{d}^{k}</math>
is defined as the maximum quotient <math>\,k/d</math> such that the graph <math>\,G_{d}^{k}</math>
(<math>k \geq 2d</math>)
(<math>k \geq 2d</math>)
admits a homomorphism to <math>G</math>.
admits a homomorphism to <math>\,G</math>.


The graph <math>G_{d}^{k}</math> is defined as follows:
The graph <math>G_{d}^{k}</math> is defined as follows:
Строка 11: Строка 11:


<math>E(G_{d}^{k}) = \{v_{i},v_{j} : d \leq |j - i| \leq k-d \bmod k\}.</math>
<math>E(G_{d}^{k}) = \{v_{i},v_{j} : d \leq |j - i| \leq k-d \bmod k\}.</math>
==Литература==
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.