Efficient $k$-limited Dominating Broadcasts in Product Graphs

Bharadwaj, A. Senthil Thilak

In a graph $G$, a subset of vertices $S$ is called an efficient dominating set (EDS) if every vertex in the graph is uniquely dominated by exactly one vertex in $S$. A graph…