- Tytuł:
- Some Progress on the Double Roman Domination in Graphs
- Autorzy:
-
Rad, Nader Jafari
Rahbani, Hadi - Powiązania:
- https://bibliotekanauki.pl/articles/31343730.pdf
- Data publikacji:
- 2019-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Roman domination
double Roman domination - Opis:
- For a graph $ G = (V,E) $, a double Roman dominating function (or just DRDF) is a function $ f : V \rightarrow {0, 1, 2, 3} $ having the property that if $ f(v) = 0 $ for a vertex $ v $, then $ v $ has at least two neighbors assigned 2 under $ f $ or one neighbor assigned 3 under $ f $, and if $ f(v) = 1 $, then vertex $ v $ must have at least one neighbor $ w $ with $ f(w) \ge 2 $. The weight of a DRDF $f$ is the sum $f(V) = \Sigma_{ v \in V } f(v) $, and the minimum weight of a DRDF on $G$ is the double Roman domination number of $G$, denoted by $ \gamma_{dR} (G) $. In this paper, we derive sharp upper and lower bounds on $ \gamma_{dR} (G) + \gamma_{dR} ( \overline{G} ) $ and also $ \gamma_{dR} (G ) \gamma_{dR} ( \overline{G} ) $, where $ \overline{G} $ is the complement of graph $G$. We also show that the decision problem for the double Roman domination number is NP- complete even when restricted to bipartite graphs and chordal graphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 1; 41-53
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł