Aug 10, 2022 · It has been shown that minimal Roman dominating functions can be enumerated with polynomial delay, contrasting what is known about minimal dominating sets.

Aug 21, 2023 · A function that assigns 0,1,2 to the vertices of an undirected graph is called a Roman dominating function if each vertex assigned zero has a neighbor assigned ...

Aug 31, 2023 · The concept of Roman domination has recently been studied concerning enumerating and counting in F.~N. Abu-Khzam et al. (WG 2022).

Here, we find ways how to use the underlying combinatorial ideas for non-trivial enumeration algorithms for minimal. Roman dominating functions in split graphs, ...

This paper presents an enumeration algorithm running in time $\mathcal{O}(1.4656^n)$ for split graphs and for cobipartite graphs and allows to give concrete ...

In this paper, we focus on special graph classes. More specifically, for chordal graphs, we present an enumeration algorithm running in time O ( 1.894 ...

The work reported in this paper has mainly addressed general graphs. More improvements of both enumeration and counting of minimal Roman dominating ...

Aug 10, 2022 · It has been shown that minimal Roman dominating functions can be enumerated with polyno- mial delay, contrasting what is known about minimal ...

Aug 21, 2023 · It has been shown that minimal Roman dominating functions can be enumerated with polynomial delay, i.e., between any two outputs of a solution, ...

The concept of Roman domination has recently been studied concerning enumerating and counting in F. N. Abu-Khzam et al. (WG 2022). More technically speaking ...