A Roman dominating function (or just RDF) on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(V (G)) = Pu2V (G) f(u). The Roman domination number of a graph G, denoted by R(G), is the minimum weight of a Roman dominating function on G. A graph G is Roman domination stable if the Roman domination number of G remains unchanged under removal of any vertex. In this paper we present upper bounds for the Roman domination number in the class of Roman domination stable graphs, improving bounds posed in [V. Samodivkin, Roman domination in graphs: the class RUV R, Discrete Math. Algorithms Appl. 8 (2016) 1650049].
@article{bwmeta1.element.doi-10_7151_dmgt_1975,
author = {Majid Hajian and Nader Jafari Rad},
title = {On The Roman Domination Stable Graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {37},
year = {2017},
pages = {859-871},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1975}
}
Majid Hajian; Nader Jafari Rad. On The Roman Domination Stable Graphs. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 859-871. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1975/