Bounds on the exponential domination number
From MaRDI portal
Publication:729783
DOI10.1016/j.disc.2016.08.024zbMath1351.05167arXiv1510.08749OpenAlexW1832373672WikidataQ115577241 ScholiaQ115577241MaRDI QIDQ729783
Pascal Ochem, Stéphane Bessy, Dieter Rautenbach
Publication date: 22 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.08749
Related Items (7)
Porous exponential domination in Harary graphs ⋮ Hereditary equality of domination and exponential domination ⋮ Exponential domination in subcubic graphs ⋮ Relating domination, exponential domination, and porous exponential domination ⋮ Exponential independence in subcubic graphs ⋮ A vulnerability parameter of networks ⋮ A linear programming method for exponential domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance domination versus iterated domination
- Distance domination, guarding and covering of maximal outerplanar graphs
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- Broadcasts and domination in trees
- Bounds on the connected \(k\)-domination number in graphs
- Optimal broadcast domination in polynomial time
- A note on the k-domination number of a graph
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Domination with exponential decay
- Distance domination and distance irredundance in graphs
- Bounds on the \(k\)-domination number of a graph
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- Broadcasts in graphs
- Onk-domination and minimum degree in graphs
- An upper bound for thek-domination number of a graph
This page was built for publication: Bounds on the exponential domination number
