3 papers
cs.DS2026
A note on efficient k-limited broadcast domination in graphs
Bharadwaj, A. Senthil Thilak
An efficient -limited dominating broadcast, or -ELDB, is a -limited broadcast in which every vertex is dominated exactly once. This notion brings together efficient domina…
math.CO2025
Efficient -limited Dominating Broadcasts in Product Graphs
Bharadwaj, A. Senthil Thilak
In a graph , a subset of vertices is called an efficient dominating set (EDS) if every vertex in the graph is uniquely dominated by exactly one vertex in . A graph…
math.CO2023
Efficient Domination in Lattice graphs
A. Senthil Thilak, Bharadwaj
Given a graph , a subset of vertices of is an efficient dominating set () if for all . A graph is efficiently dominatable if it po…