@article {
author = {Samodivkin, Vladimir},
title = {Roman domination excellent graphs: trees},
journal = {Communications in Combinatorics and Optimization},
volume = {3},
number = {1},
pages = {1-24},
year = {2018},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2017.25806.1041},
abstract = {A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $gamma_R$-excellent if for each vertex $x in V$there is a $gamma_R$-function $h_x$ on $G$ with $h_x(x) not = 0$. We present a constructive characterization of $gamma_R$-excellent trees using labelings. A graph $G$ is said to be in class $UVR$ if $gamma(G-v) = gamma (G)$ for each $v in V$, where $gamma(G)$ is the domination number of $G$. We show that each tree in $UVR$ is $gamma_R$-excellent.},
keywords = {Roman domination number,excellent graphs,trees},
url = {http://comb-opt.azaruniv.ac.ir/article_13654.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13654_ec8df599ae3874367c247f6fb520698c.pdf}
}