On the domination number of a graph

AbstractFor a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the domination number γ(G) of G