Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice (Q2306596)

A vertex \(v\) in a graph \(G\) is a broadcast vertex of transmission strength \(t\) if it transmits a signal of strength \(t-d(u, v)\) to every vertex \(u\) in \(G\) with \(d(u, v) < t\). Given a set of broadcast vertices \(S \in V(G)\), the reception at a vertex \(u\) is the sum of the transmissions from the broadcast vertices in \(S\). The set \(S \in V(G)\) is called a \((t, r)\) broadcast dominating set if every vertex \(u \in V(G)\) has a reception strength \(r(u) \geq r\). The minimal cardinality of a \((t, r)\) broadcast dominating set on \(G\) is called the \((t, r)\) broadcast domination number of \(G\). In the paper the authors define efficient \((t, r)\) broadcast dominating sets as those broadcast dominating sets that minimize wasted signals in the sense that every vertex far away from broadcasting vertices receive exactly the signal strength needed and no more, while those vertices close to a broadcasting vertex only get their signal from that broadcasting vertex and from no other. The main result of the paper is a construction of efficient \((t, r)\) broadcast dominating sets on the infinite triangular grid graph for all \(t \geq r \geq 1\). In addition, upper bounds for the \((t, r)\) broadcast domination numbers for triangular matchstick graphs is established when \((t, r) \in \{(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3), (t, t)\}\).