Convex dominating set

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

A set $\,X \subseteq V(G)$ is convex in $\,G$ if vertices from all $\,(a-b)$-geodesics belong to $\,X$ for any two vertices $\,a,b \in X$. A set $\,X$ is a convex dominating set if it is convex and dominating. The convex domination number $\,\gamma_{con}(G)$ of a graph $\,G$ is the minimum cardinality of a convex dominating set in $\,G$.

Литература

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