Broadcast Domination of Triangular Matchstick Graphs and the Triangular Lattice

Blessing, Insko, Johnson and Mauretour gave a generalization of the domination number of a graph $G=(V,E)$ called the $(t,r)$ broadcast domination number which depends on the positive integer parameters $t$ and $r$. In this setting, a vertex $v\in V$ is a broadcast vertex of transmission strength $t$ if it transmits a signal of strength $t-d(u,v)$ to every vertex $u\in V$, where $d(u,v)$ denotes the distance between vertices $u$ and $v$ and $d(u,v) <t$\mathrm{.}Givenasetofbroadcastvertices$S\subseteq V$,thereceptionatvertex$u$isthesumofthetransmissionsfromthebroadcastverticesin$S$\mathrm{.}Theset$S \subseteq V$iscalleda$(t,r)$broadcastdominatingsetifeveryvertex$u \in V$hasareceptionstrength$r(u) \geq r$andforafinitegraph$G$ the cardinality of a smallest broadcast dominating set is called the $(t,r)$ broadcast domination number of $G$. In this paper, we consider the infinite triangular grid graph and define efficient $(t,r)$ broadcast dominating sets as those broadcasts that minimize signal waste. Our main result constructs efficient $(t,r)$ broadcasts on the infinite triangular lattice for all $t\geq r\geq 1$\mathrm{.}Usingthesebroadcasts,wethenprovideupperboundsforthe$(t,r)$broadcastdominationnumbersfortriangularmatchstickgraphswhen$(t,r)\in{(2,1),(3,1),(3,2),(4,1),(4,2),(4,3),(t,t)}$.