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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Coordinated graph''' --- координатный граф. A graph <math>G</math> is '''coordinated'' if the cardinality of a maximum set of cliques of <math>H…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Coordinated graph''' --- координатный граф.  
'''Coordinated graph''' — ''[[координатный граф]].''


A graph <math>G</math> is '''coordinated'' if the cardinality of a maximum set
A [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> is '''coordinated''' if the cardinality of a maximum set of [[clique|cliques]] of <math>\,H</math> with a common [[vertex]] is equal to the cardinality of a minimum partition of the cliques of <math>\,H</math> into ''[[clique-independent set|clique-independent sets]]'', for every induced [[subgraph]] <math>\,H</math> of <math>\,G</math>.
of cliques of <math>H</math> with a common vertex is equal to the cardinality of
 
a minimum partition of the cliques of <math>H</math> into ''clique-independent sets'', for every induced subgraph <math>H</math> of <math>G</math>.
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия от 12:57, 25 января 2017

Coordinated graphкоординатный граф.

A graph [math]\displaystyle{ \,G }[/math] is coordinated if the cardinality of a maximum set of cliques of [math]\displaystyle{ \,H }[/math] with a common vertex is equal to the cardinality of a minimum partition of the cliques of [math]\displaystyle{ \,H }[/math] into clique-independent sets, for every induced subgraph [math]\displaystyle{ \,H }[/math] of [math]\displaystyle{ \,G }[/math].

Литература

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