Distance paired domination numbers of graphs (Q2427506)

Let \(G=(V,E)\) be a graph without an isolated vertex. A set \(D\subset V(G)\) is a dominating set of \(G\) if every vertex in \(V(G)-D\) is adjacent to at least one vertex in \(D\). A set \(D\subset V(G)\) is a paired dominating set of \(G\) if it is dominating and the indiced subgraph \(<D>\) has a perfect matching. A set \(D\subset V(G)\) is a \(k\)-distance dominating set of \(G\) if every vertex in \(V(G)-D\) is within distance \(k\) of at least one vertex in \(D\). The \(k\)-distance domination number \(\gamma^k(G)\) of \(G\) equals the minimum cordinality among all \(k\)-distance dominating sets of \(G\). In the paper, a generalization of the paired domination number is studied. The author says that a set \(D\subset V(G)\) is a \(k\)-distance paired dominating set of \(G\) if \(D\) is a \(k\)-distance dominating set of \(G\) and the induced subgraph \(<D>\) has a perfect matching. The \(k\)-distance paired domination number \(\gamma^k_p(G)\) is the cordinality of a smallest \(k\)-distance paired dominating set of \(G\). In the paper, properties of \(\gamma^k_p(G)\) are investigated. An upper and a lower bound on \(\gamma^k_p(G)\) are found for \(G=\) nontrival tree.