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

DOI10.46298/DMTCS.11478arXiv2110.08943MaRDI QIDQ6507645FDOQ6507645

Authors: Aaron Slobodin, Gary MacGillivray, Wendy Myrvold

Abstract: We establish exact values for the 2-limited broadcast domination number of various grid graphs, in particular

C_{m} s q u a r e C_{n}

for

3 l e q m l e q 6

and all

n g e q m

,

P_{m} s q u a r e C_{3}

for all

m g e q 3

, and

P_{m} s q u a r e C_{n}

for

4 l e q m l e q 5

and all

n g e q m

. We also produce periodically optimal values for

P_{m} s q u a r e C_{4}

and

P_{m} s q u a r e C_{6}

for

m g e q 3

,

P_{4} s q u a r e P_{n}

for

n g e q 4

, and

P_{5} s q u a r e P_{n}

for

n g e q 5

. Our method completes an exhaustive case analysis and eliminates cases by combining tools from linear programming with various mathematical proof techniques.

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 Q6507645)