On the total Roman domination in trees
From MaRDI portal
Publication:1717206
DOI10.7151/DMGT.2099zbMath1404.05146OpenAlexW2803382364MaRDI QIDQ1717206
Marzieh Soroudi, Jafar Amjadi, Seyyed Mahmoud Sheikholeslami
Publication date: 7 February 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2099
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
On the total and strong version for Roman dominating functions in graphs ⋮ Total Roman domination for proper interval graphs ⋮ Total Roman domination edge-critical graphs ⋮ Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs ⋮ Varieties of Roman Domination ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ Total Roman domatic number of a graph ⋮ Total Roman {2}-domination in graphs ⋮ Double domination in lexicographic product graphs ⋮ Total Roman domination subdivision number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Roman domination on strongly chordal graphs
- Dominating sets in social network graphs
- Roman domination in graphs.
- Mixed Roman domination in graphs
- Nordhaus-Gaddum bounds for total Roman domination
- Defending the Roman Empire---a new strategy
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Total Roman domination in graphs
- Global total Roman domination in graphs
This page was built for publication: On the total Roman domination in trees