Convex dominating set: различия между версиями

'''Convex dominating set''' — ''[[выпуклое доминирующее множество]].''

A set <math>\,X \subseteq V(G)</math> is '''convex''' in <math>\,G</math> if [[vertex|vertices]] from all <math>\,(a-b)</math>-geodesics belong to <math>\,X</math> for any two vertices <math>\,a,b \in X</math>. A set <math>\,X</math> is a '''convex dominating set''' if it is convex and

dominating. The '''convex domination number''' <math>\,\gamma_{con}(G)</math> of a

[[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> is the minimum cardinality of a convex dominating set in <math>\,G</math>.

 

 

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