Towards a new framework for domination

Abstract 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.

[1]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[2]  Gabriela Cristescu,et al.  Classes of Discrete Convexity Properties , 2004, Discret. Comput. Geom..

[3]  Stephen T. Hedetniemi,et al.  Towards a theory of domination in graphs , 1977, Networks.

[4]  Claude Berge.  Theory of graphs and its applications , 1962 .

[5]  O. Ore.  Theory of Graphs , 1962 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Ortrud R. Oellermann,et al.  Rebuilding convex sets in graphs , 2005, Discret. Math..

[8]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[9]  Jayme Luiz Szwarcfiter,et al.  Some remarks on the geodetic number of a graph , 2010, Discret. Math..

[10]  Ernest J. Cockayne,et al.  The sequence of upper and lower domination, independence and irredundance numbers of a graph , 1993, Discret. Math..

[11]  Gary Chartrand,et al.  Boundary vertices in graphs , 2003, Discret. Math..

[12]  Béla Bollobás,et al.  Graph-theoretic parameters concerning domination, independence, and irredundance , 1979, J. Graph Theory.

[13]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[14]  Michael A. Henning,et al.  Stratification and domination in graphs , 2003, Discret. Math..

[15]  Jayme Luiz Szwarcfiter,et al.  On the computation of the hull number of a graph , 2009, Discret. Math..

[16]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[17]  Odile Favaron,et al.  Two relations between the parameters of independence and irredundance , 1988, Discret. Math..

[18]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[19]  Van de M. L. J. Vel.  Theory of convex structures , 1993 .

[20]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[21]  E. Cockayne,et al.  Properties of Hereditary Hypergraphs and Middle Graphs , 1978, Canadian Mathematical Bulletin.

[22]  John L. Pfaltz,et al.  Closure systems and their structure , 2001, Inf. Sci..

[23]  Stephen T. Hedetniemi,et al.  A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[24]  Gerard J. Chang,et al.  Algorithmic Aspects of Domination in Graphs , 1998 .