Roman Dominating Set in Graphs

Regita Verensia (H1011191004), Dwi Suryaningsih (H1011191008), Nyemas Yupika Sari (H1011191011),
Fitriyani (H1011191010), Rawiha Nur Afifah (H1011191037), Rina Robiah Adawiah (H1011191038)

Definition Proposition 2

A set 𝑆 ⊆ 𝑉 is called a dominating set if every 𝑢 in 𝑉 is either in
𝑆 or is adjacent to a vertex in 𝑆. Minimal dominating set is a set
where none of its proper subset is a dominating set. Domination
number (𝛾(𝐺)) is a minimum cardinality of a dominating set. A
dominating set 𝑆 of minimum cardinality is called a 𝛾-set of 𝐺.
A Roman dominating function on a graph 𝐺 = (𝑉, 𝐸) is a
function 𝑓: 𝑉 → {0, 1, 2} satisfying the condition that every vertex 𝑢
for which 𝑓 (𝑢) = 0 is adjacent to at least one vertex 𝑣 for which
𝑓(𝑣) = 2. The weight of a Roman dominating function is the sum of
values assigned to all vertices or can be stated as
෍ 𝑓(𝑢)
𝑢∈𝑉
Roman domination number of 𝐺 (𝛾𝑅 (𝐺)) is the minimum weight
of all possible Roman dominating function on a graph G.
A graph 𝐺 is Roman if and only if it has a 𝛾𝑅 -function 𝑓 = (𝑉0 , 𝑉1 , 𝑉2 ) with
𝑛1 = |𝑉1 | = 0.
Proof.
⟹: Let 𝐺 be a Roman graph and let 𝑓 = (𝑉0 , 𝑉1 , 𝑉2 ) be a 𝛾𝑅 -function of 𝐺.
It is clear that 𝑉2 is a 𝛾-set of 𝐺ሾ𝑉0 ∪ 𝑉2 ሿ. Thus, 𝑉2 ≻ 𝑉0 and 𝑉1 ∪ 𝑉2 ≻ 𝑉,
hence:
𝛾(𝐺 ) ≤ |𝑉1 ∪ 𝑉2 | = |𝑉1 | + |𝑉2 | ≤ |𝑉1 | + 2|𝑉2 | = 𝛾𝑅 (𝐺)
But since 𝐺 is Roman, so
2𝛾 (𝐺 ) = 2(|𝑉1 | + |𝑉2 |) = 2|𝑉1 | + 2|𝑉2 | = 𝛾𝑅 (𝐺 ) = |𝑉1 | + 2|𝑉2 |
Hence, 𝑛1 = |𝑉1 | = 0.
⇐: Let 𝑓 = (𝑉0 , 𝑉1 , 𝑉2 ) be a 𝛾𝑅 -function of 𝐺 with 𝑛1 = |𝑉1 | = 0 .
Therefore, 𝛾𝑅 (𝐺 ) = 2|𝑉2 |, and since by definition 𝑉1 ∪ 𝑉2 ≻ 𝑉, it follows
that 𝑉2 is a dominating set of 𝐺. It is clear that 𝑉2 is a 𝛾-set of 𝐺ሾ𝑉0 ∪ 𝑉2 ሿ,
i.e. |𝑉2 | = 𝛾(𝐺) and 𝛾𝑅 (𝐺 ) = 2𝛾(𝐺), so 𝐺 is a Roman graph. ∎

General Setting

Let 𝐺 = (𝑉, 𝐸) be a graph of order |𝑉| = 𝑛. For any vertex 𝑣 ∈ Roman Domination Number in Some Graphs
𝑉, the open neighbourhood of 𝑣 is the set 𝑁(𝑣) = {𝑢 ∈ 𝑉 | 𝑢𝑣 ∈ 𝐸}
and the closed neighbourhood is the set 𝑁 ሾ𝑣ሿ = 𝑁(𝑣) ∪ {𝑣}. For a set No. Graph Roman domination
𝑆 ⊆ 𝑉, the open neighbourhood is 𝑁(𝑆) = ‫ )𝑣(𝑁 𝑆∈𝑣ڂ‬and the closed number
neighbourhood is 𝑁 ሾ𝑆ሿ = 𝑁(𝑆) ∪ 𝑆.
1. 𝐶𝑝 2𝑛
For a graph 𝐺 = (𝑉, 𝐸 ), let 𝑓: 𝑉 → {0, 1, 2}, and let (𝑉0 , 𝑉1 , 𝑉2 ) be 𝛾𝑅 (𝐶𝑛 ) = ඄ ඈ
3
the ordered partition of 𝑉 induced by 𝑓, where 𝑉𝑖 = {𝑣 ∈ 𝑉 |𝑓(𝑣) =
𝑖} and |𝑉𝑖 | = 𝑛𝑖 , for 𝑖 = 0, 1, 2. Thus, it can be written 𝑓 = (𝑉0 , 𝑉1 , 𝑉2 ). 2. 𝑃𝑝 2𝑛
𝛾𝑅 (𝑃𝑛 ) = ඄ ඈ
3
A function 𝑓 = (𝑉0 , 𝑉1 , 𝑉2 ) is a Roman dominating function (RDF)
if the set 𝑉2 dominates the set 𝑉0 (𝑉2 ≻ 𝑉0 ). The weight of 𝑓 is 3. തതത𝑛ത
𝐾 𝛾𝑅 (𝐺 ) = 𝛾(𝐺)
𝑓(𝑉) = σ𝑣∈𝑉 𝑓(𝑉) = 2𝑛2 + 𝑛1 . We also say 𝑓 is a 𝛾𝑅 -function if 4. 𝐾𝑚1,…,𝑚𝑛 with 𝑚1 ≤ 𝑚2 ≤ ⋯ ≤ 𝑚𝑛 𝛾𝑅 (𝐺 ) = 4, if 𝑚1 ≥ 3
𝑓(𝑉) = 𝛾𝑅 (𝐺). 𝛾𝑅 (𝐺 ) = 3, if 𝑚1 = 2
𝛾𝑅 (𝐺 ) = 2, if 𝑚1 = 1
5. Order 𝑛 and contains a vertex of 𝛾𝑅 (𝐺 ) = 2
degree 𝑛 − 1
6. 𝐺2,𝑛 𝛾𝑅 (𝐺 ) = 𝑛 + 1

Proposition 1 7. Connected graph of order 𝑛 𝛾𝑅 (𝐺 ) = 𝛾(𝐺 ) + 1

For any graph 𝐺, 8. Tree with two or more vertices 𝛾𝑅 (𝐺 ) = 𝛾(𝐺 ) + 1

𝛾(𝐺) ≤ 𝛾𝑅 (𝐺) ≤ 2𝛾(𝐺)

Proof.
Let 𝑓 = (𝑉0 , 𝑉1 , 𝑉2 ) be a 𝛾𝑅 -function and let 𝑆 be a 𝛾-set of 𝐺.
Then, 𝑉1 ∪ 𝑉2 is a dominating set of 𝐺 and (∅, ∅, 𝑆) is a Roman
dominating function. Hence, 𝛾(𝐺 ) ≤ |𝑉1 | + |𝑉2 | ≤ |𝑉1 | + 2|𝑉2 | =
𝛾𝑅 (𝐺). But 𝛾𝑅 (𝐺 ) ≤ 2|𝑆| = 2𝛾(𝐺). More Theorem
Thus, 𝛾(𝐺) ≤ 𝛾𝑅 (𝐺) ≤ 2𝛾(𝐺). ∎
• 𝛾(𝐺 ) = 𝛾𝑅 (𝐺) only for trivial graph
• 𝛾𝑅 (𝐺 ) = 2𝛾(𝐺) are called Roman graphs

References

[1] Aparna Lakshmanan S. (2020, April 27). Introduction to Roman Domination Number [Video]. YouTube.
https://www.youtube.com/watch?v=jSY_M6NgFAA&feature=youtu.be.
[2] Cockayne, E. J., P. A. Dreyer, Jr., S. M. Hedetniemi, S. T. Hedetniemi. (2004). Roman Domination in Graphs. Discrete Mathematics, (278), 11-22.
https://www.sciencedirect.com/science/article/pii/S0012365X03004473.
[3] Januarti, Y., M. Kiftiah, N. Kusumastuti. (2015). Fungsi Dominasi Romawi pada Line Graph. Buletin Ilmiah Matematika, Statistika, dan Terapannya,
2(4), 119-126. https://jurnal.untan.ac.id/index.php/jbmstr/article/view/10827/0.