Total Roman {2}-domination in graphs
Sign Up to like & getrecommendations! Published in 2019 at "Quaestiones Mathematicae"
DOI: 10.2989/16073606.2019.1695230
Abstract: Abstract Given a graph G = (V, E), a function f: V → {0, 1, 2} is a total Roman {2}-dominating function if every vertex ʋ ∈ V for which f (ʋ) = 0 satisfies… read more here.
Keywords: function; roman domination; domination; total roman ... See more keywords
Signed strong Roman domination in graphs
Sign Up to like & getrecommendations! Published in 2017 at "Tamkang Journal of Mathematics"
DOI: 10.5556/j.tkjm.48.2017.2240
Abstract: Let $G=(V,E)$ be a finite and simple graph of order $n$ and maximum degree $\Delta$. A signed strong Roman dominating function (abbreviated SStRDF) on a graph $G$ is a function $f:V\to \{-1,1,2,\ldots,\lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the conditions… read more here.
Keywords: roman domination; domination graphs; strong roman; signed strong ... See more keywords