Proving exact values for the \(2\)-limited broadcast domination number on grid graphs
From MaRDI portal
Publication:6599802
DOI10.46298/dmtcs.11478zbMATH Open1547.0523MaRDI QIDQ6599802
Gary MacGillivray, Aaron Slobodin, Wendy J. Myrvold
Publication date: 6 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
linear programminginteger linear programminggrid graphsbroadcast dominationlimited broadcast domination
Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Broadcasts and domination in trees
- Radial trees
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- Broadcast domination and multipacking in strongly chordal graphs
- Broadcasts in graphs
- Broadcast Domination in Graphs
- General bounds on limited broadcast domination
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- 2-limited broadcast domination on grid graphs
This page was built for publication: Proving exact values for the \(2\)-limited broadcast domination number on grid graphs