2-limited broadcast domination in subcubic graphs
From MaRDI portal
Publication:2197488
DOI10.1016/J.DAM.2020.07.010zbMATH Open1447.05155OpenAlexW3043877875MaRDI QIDQ2197488FDOQ2197488
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
Recommendations
Cites Work
- Total Domination in Graphs
- Edge Weighting Functions on Dominating Sets
- Paths, Stars and the Number Three
- Independent Domination in Cubic Graphs
- Broadcasts in graphs
- Title not available (Why is that?)
- On domination in connected cubic graphs
- Optimal broadcast domination in polynomial time
- Radial trees
- New bounds for the broadcast domination number of a graph
- Title not available (Why is that?)
- A linear‐time algorithm for broadcast domination in a tree
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k\)-broadcast domination and \(k\)-multipacking
- On the difference between broadcast and multipacking numbers of graphs
- General bounds on limited broadcast domination
- Independent domination in subcubic graphs of girth at least six
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
Cited In (6)
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- 2-limited broadcast domination on grid graphs
- Broadcast Domination in Graphs
- Broadcast domination in subcubic graphs
This page was built for publication: 2-limited broadcast domination in subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197488)
