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

DOI10.46298/DMTCS.11478MaRDI QIDQ6599802zbMATH OpenFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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)

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

Cites work

• scientific article; zbMATH DE number 2109329 (Why is no real title available?)
• 2-limited broadcast domination on grid graphs
• 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
• Broadcast domination and multipacking in strongly chordal graphs
• Broadcast domination in graphs
• Broadcast domination of products of graphs
• Broadcasts and domination in trees
• Broadcasts in graphs
• Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
• General bounds on limited broadcast domination
• Radial trees

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)