Bharadwaj

activity

20232026

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

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…

math.CO2023

Efficient Domination in Lattice graphs

A. Senthil Thilak, Bharadwaj

Given a graph $G$ , a subset $S$ of vertices of $G$ is an efficient dominating set ( $E D S$ ) if $∣ N [v] \cap S ∣ = 1,$ for all $v \in V (G)$ . A graph $G$ is efficiently dominatable if it po…

Efficient k-limited Dominating Broadcasts in Product Graphs

Efficient Domination in Lattice graphs

Efficient $k$ -limited Dominating Broadcasts in Product Graphs