A. Senthil Thilak

activity

20232025

collaborators

3 papers

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.FA2024

Frame Scaling by Graphs

Ayyanar K, P. Sam Johnson, A. Senthil Thilak

In this paper, we investigate the scalability of a given frame in $R^{n}$ by using graphs. For each frame $ϕ$ in $R^{n}$ , we associate a simple undirected graph $G(ϕ)…

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

Frame Scaling by Graphs

Efficient Domination in Lattice graphs

Efficient $k$ -limited Dominating Broadcasts in Product Graphs