- Tytuł:
- On The Co-Roman Domination in Graphs
- Autorzy:
-
Shao, Zehui
Sheikholeslami, Seyed Mahmoud
Soroudi, Marzieh
Volkmann, Lutz
Liu, Xinmiao - Powiązania:
- https://bibliotekanauki.pl/articles/31343438.pdf
- Data publikacji:
- 2019-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
co-Roman dominating function
co-Roman domination number
Roman domination - Opis:
- Let $G = (V, E)$ be a graph and let $f : V (G) \rightarrow {0, 1, 2}$ be a function. A vertex $v$ is said to be protected with respect to $f$, if $f(v) > 0$ or $f(v) = 0$ and $v$ is adjacent to a vertex of positive weight. The function $f$ is a co-Roman dominating function if (i) every vertex in $V$ is protected, and (ii) each $ v \in V $ with positive weight has a neighbor $ u \in V $ with $ f(u) = 0 $ such that the function $ f_{uv} : V \rightarrow {0, 1, 2} $, defined by $ f_{uv} (u) = 1$, $ f_{uv}(v) = f(v) − 1$ and $ f_{uv}(x) = f(x)$ for $ x \in V \backslash \{ v, u \} $, has no unprotected vertex. The weight of $f$ is $ \omega(f) = \Sigma_{ v \in V } f(v) $. The co-Roman domination number of a graph $G$, denoted by $ \gamma_{cr}(G) $, is the minimum weight of a co-Roman dominating function on $G$. In this paper, we give a characterization of graphs of order $n$ for which co-Roman domination number is \( \tfrac{2n}{3} \) or $n − 2$, which settles two open problem in [S. Arumugam, K. Ebadi and M. Manrique, Co-Roman domination in graphs, Proc. Indian Acad. Sci. Math. Sci. 125 (2015) 1–10]. Furthermore, we present some sharp bounds on the co-Roman domination number.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 455-472
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki