%0 Journal Article
%T Outer independent Roman domination number of trees
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Dehgardi, Nasrin
%A Chellali, M
%D 2021
%\ 12/01/2021
%V 6
%N 2
%P 273-286
%! Outer independent Roman domination number of trees
%K Outer independent Roman dominating function
%K outer independent Roman domination number
%K tree
%R 10.22049/cco.2021.27072.1191
%X A Roman dominating function (RDF) on a graph $G=(V,E)$ is a function $f:Vrightarrow {0,1,2}$ such that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. An RDF $f$ is called an outer independent Roman dominating function (OIRDF) if the set of vertices assigned a $0$ under $f$ is an independent set. The weight of an OIRDF is the sum of its function values over all vertices, and the outer independent Roman domination number $gamma _{oiR}(G)$ is the minimum weight of an OIRDF on $G$. In this paper, we show that if $T$ is a tree of order $ngeq 3$ with $s(T)$ support vertices, then $gamma _{oiR}(T)leq min {frac{5n}{6},frac{3n+s(T)}{4}}.$ Moreover, we characterize the tress attaining each bound.
%U http://comb-opt.azaruniv.ac.ir/article_14162_bc649d348f3b3863bd5517b8d106538d.pdf