2-limited broadcast domination in subcubic graphs
From MaRDI portal
(Redirected from Publication:2197488)
Recommendations
Cites work
- scientific article; zbMATH DE number 6843211 (Why is no real title available?)
- scientific article; zbMATH DE number 2170461 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- A linear‐time algorithm for broadcast domination in a tree
- Broadcast domination of products of graphs
- Broadcasts in graphs
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- Edge weighting functions on dominating sets
- General bounds on limited broadcast domination
- Independent domination in cubic graphs
- Independent domination in subcubic graphs of girth at least six
- New bounds for the broadcast domination number of a graph
- On domination in connected cubic graphs
- On the difference between broadcast and multipacking numbers of graphs
- Optimal broadcast domination in polynomial time
- Paths, Stars and the Number Three
- Radial trees
- Total domination in graphs
- k-broadcast domination and k-multipacking
Cited in
(7)- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- Proving exact values for the \(2\)-limited broadcast domination number on grid graphs
- Broadcast domination in graphs
- 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 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)