Dominating sets inducing large component in graphs with minimum degree two
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.
- Bounds related to domination in graphs with minimum degree two
- Dominating sets inducing large components
- Dominating sets inducing large components in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Domination in graphs of minimum degree at least two and large girth
- Domination in graphs with minimum degree two
- Domination-balanced graphs
- Graph theory
- Graphs with large total domination number
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- Total domination in graphs
- Total domination in graphs
- Total domination in maximal outerplanar graphs. II.
This page was built for publication: Dominating sets inducing large component in graphs with minimum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133670)
