Broadcast Domination of Triangular Matchstick Graphs and the Triangular Lattice

MaRDI QIDQ6300612zbMATH OpenFDO

Authors Pamela E. Harris, Dalia K. Luque, Claudia Reyes Flores, Nohemi Sepulveda

Publication date 20 April 2018

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: 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 $vinV$ is a broadcast vertex of transmission strength $t$ if it transmits a signal of strength $t-d(u,v)$ to every vertex $uinV$, where $d(u,v)$ denotes the distance between vertices $u$ and $v$ and $d(u,v)<t$. Given a set of broadcast vertices $SsubseteqV$, the reception at vertex $u$ is the sum of the transmissions from the broadcast vertices in $S$. The set $SsubseteqV$ is called a $(t,r)$ broadcast dominating set if every vertex $uinV$ has a reception strength $r(u)geqr$ and for a finite graph $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 $tgeqrgeq1$. Using these broadcasts, we then provide upper bounds for the $(t,r)$ broadcast domination numbers for triangular matchstick graphs when $(t,r)in(2,1),(3,1),(3,2),(4,1),(4,2),(4,3),(t,t)$.

This page was built for publication: Broadcast Domination of Triangular Matchstick Graphs and the Triangular Lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300612)