The Distance Roman Domination Numbers of Graphs

@article{HamidehAram2013,
abstract = {Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → \{0, 1, 2\} such that for every vertex with label 0, there is a vertex with label 2 at distance at most k from each other. The weight of a k-distance Roman dominating function f is the value w(f) =∑v∈V f(v). The k-distance Roman domination number of a graph G, denoted by γkR (D), equals the minimum weight of a k-distance Roman dominating function on G. Note that the 1-distance Roman domination number γ1R (G) is the usual Roman domination number γR(G). In this paper, we investigate properties of the k-distance Roman domination number. In particular, we prove that for any connected graph G of order n ≥ k +2, γkR (G) ≤ 4n/(2k +3) and we characterize all graphs that achieve this bound. Some of our results extend these ones given by Cockayne et al. in 2004 and Chambers et al. in 2009 for the Roman domination number.},
author = {Hamideh Aram, Sepideh Norouzian, Seyed Mahmoud Sheikholeslami},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {k-distance Roman dominating function; k-distance Roman domination number; Roman dominating function; Roman domination number; -distance Roman dominating function; -distance Roman domination number},
language = {eng},
number = {4},
pages = {717-730},
title = {The Distance Roman Domination Numbers of Graphs},
url = {http://eudml.org/doc/268287},
volume = {33},
year = {2013},
}

TY - JOUR
AU - Hamideh Aram
AU - Sepideh Norouzian
AU - Seyed Mahmoud Sheikholeslami
TI - The Distance Roman Domination Numbers of Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2013
VL - 33
IS - 4
SP - 717
EP - 730
AB - Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0, 1, 2} such that for every vertex with label 0, there is a vertex with label 2 at distance at most k from each other. The weight of a k-distance Roman dominating function f is the value w(f) =∑v∈V f(v). The k-distance Roman domination number of a graph G, denoted by γkR (D), equals the minimum weight of a k-distance Roman dominating function on G. Note that the 1-distance Roman domination number γ1R (G) is the usual Roman domination number γR(G). In this paper, we investigate properties of the k-distance Roman domination number. In particular, we prove that for any connected graph G of order n ≥ k +2, γkR (G) ≤ 4n/(2k +3) and we characterize all graphs that achieve this bound. Some of our results extend these ones given by Cockayne et al. in 2004 and Chambers et al. in 2009 for the Roman domination number.
LA - eng
KW - k-distance Roman dominating function; k-distance Roman domination number; Roman dominating function; Roman domination number; -distance Roman dominating function; -distance Roman domination number
UR - http://eudml.org/doc/268287
ER -