Proving exact values for the 2-limited broadcast domination number on grid graphs

DOI10.46298/DMTCS.11478zbMATH Open1547.0523MaRDI QIDQ6599802FDOQ6599802

Authors: Aaron Slobodin, Gary MacGillivray, Wendy Myrvold 

Publication date: 6 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Recommendations

• 2-limited broadcast domination on grid graphs
• Upper bounds of \(k\)-limited dominating broadcasts for some grid graphs
• On \((t,r)\) broadcast domination numbers of grids
• 2-limited broadcast domination in subcubic graphs
• 2-limited dominating broadcasts on cubic graphs without induced 4-cycles

zbMATH Keywords

linear programminginteger linear programminggrid graphsbroadcast dominationlimited broadcast domination

Mathematics Subject Classification ID

Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Broadcasts in graphs
• Title not available (Why is that?)
• Broadcasts and domination in trees
• Radial trees
• Broadcast domination in graphs
• 2-limited broadcast domination on grid graphs
• Broadcast domination of products of graphs
• General bounds on limited broadcast domination
• Broadcast domination and multipacking in strongly chordal graphs
• Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
• 2-limited dominating broadcasts on cubic graphs without induced 4-cycles

Cited In (1)

• Upper bounds of \(k\)-limited dominating broadcasts for some grid graphs

This page was built for publication: Proving exact values for the \(2\)-limited broadcast domination number on grid graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599802)