Total Roman domination for proper interval graphs
<p>A function <em>f</em>:<em>V</em> → {0,1,2} is a total Roman dominating function (TRDF) on a graph <em>G</em>=(<em>V,E</em>) if for every vertex <em>v</em> ∈ <em>V</em> with <em>f</em>(<em>v</em>)...
Main Author: | Abolfazl Poureidi |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2020-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/952 |
Similar Items
-
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) -
On the Quasi-Total Roman Domination Number of Graphs
by: Abel Cabrera Martínez, et al.
Published: (2021-11-01) -
Total Roman Domination Number of Rooted Product Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-10-01) -
Dominating the Direct Product of Two Graphs through Total Roman Strategies
by: Abel Cabrera Martínez, et al.
Published: (2020-08-01) -
Total Roman {3}-domination in Graphs
by: Zehui Shao, et al.
Published: (2020-02-01)