1 citations · 1 across the 2 of their papers we have counts for
4 papers
On the minimum spanning tree problem in imprecise set-up
Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in…
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das +1
In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum -distance independent set problem and the…
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…
On -distance -tuple ()-domination in graphs
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das
In this article, we study the -distance -tuple ()-domination problem. Given a simple undirected graph , and positive integers and , a subse…