Proving exact values for the $2$-limited broadcast domination number on grid graphs
We establish exact values for the $2$-limited broadcast domination number of various grid graphs, in particular $C_m\square C_n$ for $3 \leq m \leq 6$ and all $n\geq m$, $P_m \square C_3$ for all $m \geq 3$, and $P_m \square C_n$ for $4\leq m \leq 5$ and all $n \geq m$. We also produce periodically...
Main Authors: | Aaron Slobodin, Gary MacGillivray, Wendy Myrvold |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2023-11-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/11478/pdf |
Similar Items
-
The 2-domination and Roman domination numbers of grid graphs
by: Michaël Rao, et al.
Published: (2019-05-01) -
General bounds on limited broadcast domination
by: José Cáceres, et al.
Published: (2018-10-01) -
The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
by: Richard C Brewster, et al.
Published: (2022-11-01) -
Homomorphically Full Oriented Graphs
by: Thomas Bellitto, et al.
Published: (2023-10-01) -
Determining Number of Kneser Graphs: Exact Values and Improved Bounds
by: Angsuman Das, et al.
Published: (2022-03-01)