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 -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…