Roman domination in direct product graphs and rooted product graphs
Let $ G $ be a graph with vertex set $ V(G) $. A function $ f:V(G)\rightarrow \{0, 1, 2\} $ is a Roman dominating function on $ G $ if every vertex $ v\in V(G) $ for which $ f(v) = 0 $ is adjacent to at least one vertex $ u\in V(G) $ such that $ f(u) = 2 $. The Roman domination number of $ G $ is th...
Main Authors: | Abel Cabrera Martínez, Iztok Peterin, Ismael G. Yero |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2021-08-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2021643?viewType=HTML |
Similar Items
-
Dominating the Direct Product of Two Graphs through Total Roman Strategies
by: Abel Cabrera Martínez, et al.
Published: (2020-08-01) -
Total Roman Domination Number of Rooted Product Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-10-01) -
Total Domination in Rooted Product Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-11-01) -
Weak Roman domination in rooted product graphs
by: Rangel Hernández-Ortiz, et al.
Published: (2021-02-01) -
From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs
by: Ana Almerich-Chulia, et al.
Published: (2021-07-01)