Combinatorial bounds on paired and multiple domination in triangulations

Abstract In this article we study some variants of domination in triangulation graphs. We establish tight combinatorial bounds for paired domination and 2-domination in maximal outerplanar graph, and for double domination and connected 2-domination in triangulations.