From convexity to domination in graphs.
Presented by Dr. María Luz PUERTAS
Type: Oral presentation
Track: Metric Graph Theory
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 work, we introduce one of these frameworks based in convexity. The main idea consists of using a notion of convexity in graphs, which has its origin in image processing, for which the usual parameters of convexity, such are convexity number, rank or Helly number, are closely related to domination parameters.