On The Roman Domination Stable Graphs

• Autorzy: Majid Hajian , Nader Jafari Rad
• Języki publikacji: EN

Abstrakty

EN

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].

Słowa kluczowe

EN

Roman domination number; bound

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 4
• Strony: 859-871

Daty

wydano

2017-11-27

otrzymano

2016-03-01

poprawiono

2016-07-01

zaakceptowano

2016-07-01

online

2017-09-02

Twórcy

autor

Majid Hajian

• ,

autor

Nader Jafari Rad

• ,

Identyfikatory

DOI

10.7151/dmgt.1975