On upper bounds for multiple domination numbers of graphs
From MaRDI portal
Publication:2444571
DOI10.1016/j.dam.2013.05.006zbMath1285.05144OpenAlexW2049256200MaRDI QIDQ2444571
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.006
dominating setdomination number\(k\)-tuple domination number\(k\)-tuple total domination number\(k\)-dominating set\(k\)-domination numberliar's dominating set\(k\)-tuple dominating set\(k\)-tuple total dominating set
Related Items
Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ Constructing dominating sets in circulant graphs ⋮ Multiple Domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-domination and \(k\)-independence in graphs: A survey
- \(k\)-tuple total domination 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
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Liar's domination in graphs
- On the ratio of optimal integral and fractional covers
- Transversal numbers of uniform hypergraphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- A generalised upper bound for the \(k\)-tuple domination number
- Dominating a Family of Graphs with Small Connected Subgraphs
- Liar's domination
- False alarms in fault-tolerant dominating sets in graphs
This page was built for publication: On upper bounds for multiple domination numbers of graphs
