Towards a new framework for domination
Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding different mathematical frameworks where domination notions naturally arise, providing new points of view about the matter. In this paper, we introduce one of these frameworks based in convexity. The main idea consists of defining a convexity in a graph, already used in image processing, for which the usual parameters of convexity are closely related to domination parameters. Moreover, the Helly number of this convexity may be viewed as a new domination parameter whose study would be of interest. (C) 2011 Elsevier Ltd. All rights reserved.
helly number digital convexity domination chain