Upper bounds on the balanced r, s -domination number of a graph

DOI10.1016/J.DAM.2014.07.016MaRDI QIDQ477351zbMATH OpenOpenAlexFDO

Authors 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 dominationmultiple domination

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds for \(f\)-domination number of graphs
• Publication:4489228
• On equality in an upper bound for the restrained and total domination numbers of a graph
• An upper bound on the domination number of a graph.
• An upper bound for the total restrained domination number of graphs
• scientific article; zbMATH DE number 5844276
• scientific article; zbMATH DE number 2170337
• A new upper bound on the total domination number of a graph
• Upper bounds for the paired-domination numbers of graphs
• A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH

Cites work

• scientific article; zbMATH DE number 1634459 (Why is no real title available?)
• scientific article; zbMATH DE number 5844276 (Why is no real title available?)
• scientific article; zbMATH DE number 5717271 (Why is no real title available?)
• scientific article; zbMATH DE number 3531438 (Why is no real title available?)
• 3-Tuple domination number in complete grid graphs
• A generalised upper bound for the \(k\)-tuple domination number
• A note on obtaining \(k\) dominating sets from a \(k\)-dominating function on a tree
• Bounds for the 2-domination number of toroidal grid graphs
• Improved upper bounds for the \(k\)-tuple domination number
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• On Dominating Sets and Independent Sets of Graphs
• On Double Domination in Graphs
• On integer domination in graphs and Vizing-like problems
• On the \(\{k\}\)-domination number of Cartesian products of graphs
• On the ratio of optimal integral and fractional covers
• On upper bounds for multiple domination numbers of graphs
• Proof of a conjecture on \(k\)-tuple domination in graphs
• Randomized algorithms and upper bounds for multiple domination in graphs and networks
• The \(k\)-tuple domination number revisited
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The upper bound on \(k\)-tuple domination numbers of graphs
• \(k\)-tuple domination in graphs

Cited in

(2)

• On the upper tail of counts of strictly balanced subgraphs
• A linear algorithm for \(\langle r, s \rangle\)-domination of a tree

This page was built for publication: Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477351)