Global total Roman domination in graphs
From MaRDI portal
Publication:5370823
DOI10.1142/S1793830917500501zbMath1373.05134OpenAlexW2732151932MaRDI QIDQ5370823
Sakineh Nazari-Moghaddam, Jafar Amjadi, Seyyed Mahmoud Sheikholeslami
Publication date: 20 October 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500501
total Roman dominating functiontotal Roman domination numberglobal total Roman dominating functionglobal total Roman domination number
Related Items (11)
On the total and strong version for Roman dominating functions in graphs ⋮ γ-induced-paired dominating graphs of paths and cycles ⋮ Global dominating broadcast in graphs ⋮ Twin signed double Roman domination numbers in directed graphs ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ On the total Roman domination in trees ⋮ An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs ⋮ Global Domination ⋮ Total Roman reinforcement in graphs ⋮ Total Roman domatic number of a graph ⋮ On computing secure domination of trees
Cites Work
- Unnamed Item
- Roman domination on strongly chordal graphs
- Global Roman domination in graphs
- Bounds on global total domination in graphs
- Nordhaus-Gaddum bounds for total Roman domination
- The total global domination number of a graph
- Global Roman domination in trees
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Total Roman domination in graphs
This page was built for publication: Global total Roman domination in graphs