An upper bound on the double Roman domination number
From MaRDI portal
Publication:5895065
DOI10.1007/S10878-018-0286-6zbMath1437.05177OpenAlexW2796445651MaRDI QIDQ5895065
Lutz Volkmann, Sakineh Nazari-Moghaddam, Seyyed Mahmoud Sheikholeslami, Jafar Amjadi
Publication date: 26 July 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0286-6
Related Items (24)
Integer linear programming formulations for double roman domination problem ⋮ Unnamed Item ⋮ Lower and upper bounds on independent double Roman domination in trees ⋮ Outer independent signed double Roman domination ⋮ Double Roman domination in generalized Petersen graphs ⋮ On the global double Roman domination of graphs ⋮ An improved upper bound on the independent double Roman domination number of trees ⋮ Disprove of a conjecture on the double Roman domination number ⋮ Independent double Roman domination in graphs ⋮ Signed double Roman domination in graphs ⋮ Outer independent double Roman domination ⋮ Algorithmic results on double Roman domination in graphs ⋮ Varieties of Roman Domination ⋮ Independent double Roman domination in graphs ⋮ Extremal digraphs for an upper bound on the double Roman domination number ⋮ Properties of double Roman domination on cardinal products of graphs ⋮ Perfect double Roman domination of trees ⋮ Bounds for signed double Roman k-domination in trees ⋮ Unnamed Item ⋮ An improved upper bound on the double Roman domination number of graphs with minimum degree at least two ⋮ Critical concept for double Roman domination in graphs ⋮ The double Roman domination number of generalized Sierpiński graphs ⋮ Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle ⋮ Double Roman domination subdivision number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Double Roman domination
- Roman domination in graphs.
- Bounds on the locating Roman domination number in trees
- Double Roman domination in trees
- Defending the Roman Empire---a new strategy
- The distance Roman domatic number of a graph
- On the double Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Domination in graphs with minimum degree two
- Double Roman domination and domatic numbers of graphs
This page was built for publication: An upper bound on the double Roman domination number