Oct 30, 2018 · In this paper we investigate a domination-like problem from the exact exponential algorithms viewpoint.

We consider the Weak Roman Domination problem. Given an undirected graph G = (V,E), the aim is to find a weak roman domination function (wrd-function for ...

This work considers the Weak Roman Domination problem, given an undirected graph G = (V,E), and finds a weak roman domination function (wrd-function for ...

We consider the Weak Roman Domination problem. Given an undirected graph G = (V,E), the aim is to find a weak roman domination function (wrd-function for ...

Abstract. We consider the Weak Roman Domination problem. Given an undirected graph G = (V,E), the aim is to find a weak ro-.

We consider the Weak Roman Domination problem. Given an undirected graph G = (V, E), the aim is to find a weak Roman domination function (wrd-function for ...

An exact exponential time algorithm for finding the weak Roman domination number of arbitrary graphs has been designed by Chapelle et al. [1] . Liu et al. [6] ...

The six classes of graphs resulting from the changing or unchanging of the Roman domination number of a graph when a vertex is deleted, or an edge is deleted or ...

The problem is already known to be NP-hard for bipartite and chordal graphs. In this paper, we further study the algorithmic complexity of the problem.

We consider the Weak Roman Domination problem. Given an undirected graph G = (V,E), the aim is to find a weak roman domination function (wrd-function for ...