4189
правок
Weakly-connected dominating set: различия между версиями
Материал из WikiGrapp
Weakly-connected dominating set (посмотреть исходный код)
Версия от 14:35, 30 августа 2011
, 30 августа 2011нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Weakly-connected dominating set''' --- слабо связное доминирующее множество. A ''' weakly-connected dominating set''', <math>{\…») |
Glk (обсуждение | вклад) Нет описания правки |
||
| Строка 3: | Строка 3: | ||
A ''' weakly-connected dominating set''', <math>{\mathcal W}</math>, of a graph <math>G</math> is | A ''' weakly-connected dominating set''', <math>{\mathcal W}</math>, of a graph <math>G</math> is | ||
a | a dominating set such that the subgraph consisting of <math>V(G)</math> and all | ||
edges incident with vertices in <math>{\mathcal W}</math> is connected. Define the | edges incident with vertices in <math>{\mathcal W}</math> is connected. Define the | ||
minimum cardinality of all weakly-connected dominating sets of <math>G</math> as | minimum cardinality of all weakly-connected dominating sets of <math>G</math> as | ||
the ''' weakly-connected domination number''' of <math>G</math> and denote this | the ''' weakly-connected domination number''' of <math>G</math> and denote this | ||
by <math>\gamma_{w}(G)</math>. | by <math>\gamma_{w}(G)</math>. | ||
