Distance irredundance and connected domination numbers of a graph (Q860459)

Let \(k\) be a positive integer and \(G\) be a connected graph. In this paper the authors consider relations among 4 graph-theoretical parameters: the \(k\)-domination number \(\gamma_{k}(G)\), the connected \(k\)-domination number \(\gamma_{k}^{c}(G)\), the \(k\)-independent domination number \(\gamma_{k}^{i}(G)\) and the \(k\)-irredundance number \(ir_{k}(G)\). The authors prove that if an \(ir_{k}\)-set \(X\) is a \(k\)-independent set of \(G\), then \(ir_{k}(G)=\gamma_{k}(G)=\gamma_{k}^{i}(G)\), and that for \(k \geq 2\), \(\gamma_{k}^{c}(G)=1\) if \(ir_{k}(G)=1\), \(\gamma_{k}^{c}(G) \leq \max\{(2k+1)ir_{k}(G)-2k, \frac{5}{2}ir_{k}(G)k - \frac{7}{2}k+2\}\) if \(ir_{k}(G)\) is odd, and \(\gamma_{k}^{c}(G) \leq \frac{5}{2}ir_{k}(G)k - 3k+2\) if \(ir_{k}(G)\) is even, and these bounds are best possible. The former generalizes results of Allan et al. and the latter results of Bo and Liu.