Dominating sets inducing large component in graphs with minimum degree two (Q6133670)

A dominating set \(S\) of a graph \(G=(V,E)\) is called a \(k\)-component dominating set if each connected component in the induced subgraph \(G[S]\) has order at least \(k\). The minimum cardinality of a \(k\)-component dominating set of \(G\) is the \(k\)-component domination number of \(G\) and is denoted by \(\gamma_k(G)\). Since \(\gamma_1(G)=\gamma(G)\) and \(\gamma_2(G)=\gamma_t(G)\), where \(\gamma(G)\) and \(\gamma_t(G)\) denote respectively the domination number and the total domination number, the \(k\)-component domination is a natural generalization of domination. A sharp upper bound for \(\gamma_k(G)\) in terms of the size \(m\) of \(G,\) when \(G\neq C_n\), \(\delta\geq 2\) and \(n\geq k+1\geq 4\), is presented in this paper.