Nordhaus-Gaddum bounds for total Roman domination
From MaRDI portal
Publication:1698063
DOI10.1007/s10878-017-0158-5zbMath1393.05193OpenAlexW2736718309MaRDI QIDQ1698063
Seyyed Mahmoud Sheikholeslami, Jafar Amjadi, Marzieh Soroudi
Publication date: 21 February 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0158-5
Related Items (16)
Total double Roman domination in graphs ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Total Roman domination on the digraphs ⋮ Global total Roman domination in graphs ⋮ On the total Roman domination in trees ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number ⋮ Quasi-total Roman domination 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 reinforcement in graphs ⋮ Total Roman domatic number of a graph ⋮ Total Roman domination in digraphs ⋮ Total Roman domination subdivision number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- Connected domination number of a graph and its complement
- A note on Roman domination in graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- On Complementary Graphs
- Extremal Problems for Roman Domination
- Total Domination in Graphs
- Total Roman domination in graphs
- Global total Roman domination in graphs
This page was built for publication: Nordhaus-Gaddum bounds for total Roman domination
