2-limited broadcast domination in subcubic graphs
From MaRDI portal
Publication:2197488
DOI10.1016/j.dam.2020.07.010zbMath1447.05155OpenAlexW3043877875MaRDI QIDQ2197488
Frank Yang, Michael A. Henning, Gary MacGillivray
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.07.010
Related Items (3)
Broadcast Domination in Graphs ⋮ Broadcast domination in subcubic graphs ⋮ 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal broadcast domination in polynomial time
- Radial trees
- \(k\)-broadcast domination and \(k\)-multipacking
- New bounds for the broadcast domination number of a graph
- Independent domination in subcubic graphs of girth at least six
- On domination in connected cubic graphs
- Broadcasts in graphs
- Independent Domination in Cubic Graphs
- General bounds on limited broadcast domination
- Paths, Stars and the Number Three
- Total Domination in Graphs
- Edge Weighting Functions on Dominating Sets
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- A linear‐time algorithm for broadcast domination in a tree
This page was built for publication: 2-limited broadcast domination in subcubic graphs