Ramesh K. Jallu

activity

20142022

most citedOn the minimum spanning tree problem in imprecise set-up

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2020

Liar's Domination in Unit Disk Graphs

Ramesh K. Jallu, Sangram K. Jena, Gautam K. Das

In this article, we study a variant of the minimum dominating set problem known as the minimum liar's dominating set (MLDS) problem. We prove that the MLDS problem is NP-hard in un…

cs.CC2019

On $d$ -distance $m$ -tuple ( $ℓ, r$ )-domination in graphs

Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das

In this article, we study the $d$ -distance $m$ -tuple ( $ℓ, r$ )-domination problem. Given a simple undirected graph $G = (V, E)$ , and positive integers $d, m, ℓ$ and $r$ , a subse…

Liar's Domination in Unit Disk Graphs

On d-distance m-tuple (ℓ,r)-domination in graphs

On $d$ -distance $m$ -tuple ( $ℓ, r$ )-domination in graphs