On domination in graphs
For a finite undirected graph G on n vertices two continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the domination number γ of G. An efficient approximation method is developed and known upper bounds on γ are slightly improved.
Vorschau
Zitieren
Rechte
Nutzung und Vervielfältigung:
