Preprint
Aug 2026
A note on efficient k-limited broadcast domination in graphs
An efficient $k$-limited dominating broadcast, or $k$-ELDB, is a $k$-limited broadcast in which every vertex is dominated exactly once. This notion brings together efficient domination and limited broadcast domination in a common framework. For a graph $G$, we write $mcr(G)$ for the smallest integer $k$ for which $G$ a...
Bharadwaj, A. S. Thilak
· 0 citations