Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph

DOI10.1016/j.dam.2014.07.016zbMath1303.05144MaRDI QIDQ477351

J. Herrera, Sumit K. Garg

Publication date: 3 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.016

zbMATH Keywords

probabilistic method; \(\langle \mathbf{r} \mathbf{s} \rangle\)-domination; \(\mathbf s\)-dominating \(\mathbf r\)-function; \(k\)-tuple domination; multiple domination

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Cites Work

• On integer domination in graphs and Vizing-like problems
• 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
• \(k\)-tuple domination in graphs
• On the \(\{k\}\)-domination number of Cartesian products of graphs
• On the ratio of optimal integral and fractional covers
• Randomized algorithms and upper bounds for multiple domination in graphs and networks
• On upper bounds for multiple domination numbers of graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• A generalised upper bound for the \(k\)-tuple domination number
• 3-Tuple domination number in complete grid graphs
• Bounds for the 2-domination number of toroidal grid graphs
• On Dominating Sets and Independent Sets of Graphs
• On Double Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item