Efficient ( t , r ) broadcast dominating sets of the triangular lattice
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)\}\).
- Optimal \((t, r)\) broadcasts on the infinite grid
- Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids
- On \((t,r)\) broadcast domination numbers of grids
- Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids
- The \(( t , r )\) broadcast domination number of some regular graphs
- R -Domination in Graphs
- Domination in graphs with minimum degree two
- Domination number of the cross product of paths
- Hamiltonian properties of triangular grid graphs
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3902703 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- Independent domination in graphs: A survey and recent results
- On \((t,r)\) broadcast domination numbers of grids
- Optimal \((t, r)\) broadcasts on the infinite grid
- Rainbow domination in graphs
- The domination numbers of the 5 × n and 6 × n grid graphs
- Optimal \((t, r)\) broadcasts on the infinite grid
- Perfect domination ratios of Archimedean lattices
- The \(( t , r )\) broadcast domination number of some regular graphs
- On \((t,r)\) broadcast domination numbers of grids
- Projects in \((t,r)\) broadcast domination
- Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids
- (t, r)-broadcast domination in graphs
- A study on triple connected certified domination numbers in power graphs of triangular grids
- (t,r) broadcast domination numbers and densities of the truncated square tiling graph
This page was built for publication: Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306596)
