Exponential domination in subcubic graphs
From MaRDI portal
Publication:504979
zbMath1353.05093arXiv1511.01398MaRDI QIDQ504979
Stéphane Bessy, Dieter Rautenbach, Pascal Ochem
Publication date: 18 January 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01398
Related Items
Exponential independence, Porous exponential domination in Harary graphs, Hereditary equality of domination and exponential domination, Relating domination, exponential domination, and porous exponential domination, Exponential independence in subcubic graphs, Hereditary equality of domination and exponential domination in subcubic graphs, A linear programming method for exponential domination
Cites Work
- 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
- Bounds on the exponential domination number
- 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
- The sextet construction for cubic graphs
- Girths of bipartite sextet graphs
- Some APX-completeness results for cubic graphs
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
