3 papers
math.CO2026
Roman domination on subclasses of bipartite graphs
Gautam K. Das, Sasmita Rout, Kamal Santra
The Roman Domination Problem (RDP) on a simple, finite, undirected graph \(G=(V,E)\) asks for a labeling function \(f:V\rightarrow\{0,1,2\}\) such that every vertex assigned value…
cs.CG2024
Improved Total Domination and Total Roman Domination in Unit Disk Graphs
Sasmita Rout, Gautam Kumar Das
Let be a simple undirected graph with no isolated vertex. A set is a total dominating set of if is a dominating set, and the set…
math.CO2021
Roman Domination in Convex Bipartite Graphs
Sasmita Rout, Gautam K. Das
In the Roman domination problem, an undirected simple graph is given. The objective of Roman domination problem is to find a function such tha…