On graphs with equal domination and 2-domination numbers (Q2483412)

Let \(G\) be a simple graph, and let \(p\) be a positive integer. A subset \(D\subseteq V(G)\) is a p-dominating set of the graph \(G\), if every vertex \(v\in V(G)-D\) is adjacent to at least \(p\) vertices in \(D\). The \(p\)-domination number \(\gamma_p(G)\) is the minimum cardinality among the \(p\)-dominating sets of \(G\). Note that the 1-domination number \(\gamma_1(G)\) is the usual domination number \(\gamma(G)\). This definition immediately leads to the inequality \(\gamma(G)\leq \gamma_2(G)\). In this paper we present some sufficient as well as some necessary conditions for graphs \(G\) with the property that \(\gamma_2(G)=\gamma(G)\). In particular, we characterize all cactus graphs \(H\) with \(\gamma_2(H)=\gamma(H)\).