New bounds on the k-domination number and the k-tuple domination number
The \(k\)-domination number \(\gamma_k(G)\) of a graph \(G\) is the cardinality of the smallest set \(D\) of vertices of \(G\) such that every vertex \(v\in V(G)\setminus D\) has at least \(k\) neighbors in \(D\); the \(k\)-tuple domination number \(\gamma_{\times k}\) is the smallest cardinility of a set \(D\) such that every vertex \(v\) of \(G\) has at least \(k\) neighbors in \(D\) (counting itself if \(v\in D\)). The authors prove the following two upper bounds on \(\gamma_k(G)\) and \(\gamma_{\times k}(G)\) for graph \(G\) with minimum degree \(\delta\) satisfying \(\frac{\delta+1}{\ln(\delta+1)}\geq 2k\): \[ \begin{aligned} \gamma_k(G) &\leq \frac{n}{\delta+1}\left(k\ln(\delta+1)+\sum_{i=0}^{k-1} \frac{1}{i!(\delta+1)^{k-1-i}}\right) \quad\text{and}\\ \gamma_{\times k}(G) &\leq \frac{n}{\delta+1}\left(k\ln(\delta+1)+\sum_{i=0}^{k-1} \frac{k-i}{i!(\delta+1)^{k-1-i}}\right).\end{aligned} \] The authors also provide a conjecture on a possible upper bound on \(\gamma_{\times k}(G)\) involving the degree sequence of a graph \(G\) which they verify for \(k=3\) as the case \(k=2\) is an earlier result of \textit{J. Harant} and \textit{M. A. Henning} [Discuss. Math., Graph Theory 25, 29--34 (2005; Zbl 1073.05049)].
- Proof of a conjecture on \(k\)-tuple domination in graphs
- The upper bound on \(k\)-tuple domination numbers of graphs
- The k-tuple domination number revisited
- A note on the k-tuple domination number of graphs
- A note on the \(k\)-tuple total domination number of a graph
- Onk-domination and minimum degree in graphs
- A note on the k-domination number of a graph
- On distance connected domination numbers of graphs.
- scientific article; zbMATH DE number 1444486
- Improved upper bounds for the k-tuple domination number
- An upper bound for thek-domination number of a graph
- Dominating a family of graphs with small connected subgraphs
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 3914371 (Why is no real title available?)
- scientific article; zbMATH DE number 3531438 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 5806 (Why is no real title available?)
- scientific article; zbMATH DE number 1444486 (Why is no real title available?)
- On Double Domination in Graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- New results on lower bounds for the number of \((\leq k)\)-facets
- Connected k-tuple twin domination in de Bruijn and Kautz digraphs
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
- On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
- On general frameworks and threshold functions for multiple domination
- Generalized threshold processes on graphs
- Bounds on the k-domination number of a graph
- On defensive alliances and strong global offensive alliances
- On upper bounds for multiple domination numbers of graphs
- A generalised upper bound for the k-tuple domination number
- 3-factor-criticality in double domination edge critical graphs
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
- The p-domination number of complete multipartite graphs
- Implications of some observations about the k-domination number
- Multiple domination
- On the complexity of reinforcement in graphs
- scientific article; zbMATH DE number 5289574 (Why is no real title available?)
- Improved upper bounds for the k-tuple domination number
- Onk-domination and minimum degree in graphs
- MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph
- NP-hardness of multiple bondage in graphs
- Exponential domination in subcubic graphs
- On the k-domination, k-tuple domination and Roman k-domination numbers in graphs
- A lower bound on the \(k\)-conversion number of graphs of maximum degree \(k+1\)
- Partial domination -- the isolation number of a graph
- Upper bounds on the k-tuple domination number and k-tuple total domination number of a graph
- scientific article; zbMATH DE number 2188621 (Why is no real title available?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- k-domination and k-tuple total domination for some chessboard graphs
- Bounds on the exponential domination number
- Onk-tuple domination of random graphs
- Approximation algorithms and ratios for multiple domination in graphs
- A polyhedral view to a generalization of multiple domination
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
- The upper bound on \(k\)-tuple domination numbers of graphs
- The k-tuple domination number revisited
- Proof of a conjecture on \(k\)-tuple domination in graphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
This page was built for publication: New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463933)