An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs

TL;DR

This paper establishes a complete proof that the double domination number in maximal outerplanar graphs is bounded above by (n+k)/2, refining a previously proposed but incomplete bound.

Contribution

It provides a complete proof confirming the upper bound for the double domination number in maximal outerplanar graphs.

Findings

The double domination number is at most (n+k)/2 in maximal outerplanar graphs.

The bound depends on the number of specific pairs of vertices on the outer cycle.

The proof corrects and completes previous incomplete results.

Abstract

In a graph $G$, a vertex dominates itself and its neighbors. A subset $S$ of vertices of $G$ is a double dominating set of $G$ if every vertex is dominated by at least two vertices in $S$. The double domination number $\gamma_{\times 2}(G)$ of $G$ is the minimum cardinality of a double dominating set of $G$. In this paper, we prove that, for a maximal outerplanar graph $G$, the double domination number $\gamma_{\times 2}(G)$ is at most $(n+k)/2$, where $k$ is the number of pairs of consecutive vertices on the outer cycle but at distance at least 3. Although this bound was previously proposed by Abd Aziz, Rad and Kamarulhaili (A note on the double domination number in maximal outerplanar and planar graphs, RAIRO Operations Research, 56 (2022) 3367--3371), their proof was found to be incomplete. In this paper we establish the validity of this result by providing a complete proof.