An upper bound on the double Roman domination number
From MaRDI portal
Publication:5895065
DOI10.1007/S10878-018-0286-6zbMATH Open1437.05177OpenAlexW2796445651MaRDI QIDQ5895065FDOQ5895065
Authors: Lutz Volkmann, J. Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmood Sheikholeslami 
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
Recommendations
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- A note on the double Roman domination number of graphs.
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Double Roman domination in trees
- On the double Roman domination in graphs
- Some progress on the double Roman domination in graphs
- scientific article; zbMATH DE number 7478539
- Double Roman domination
- Characterization of double Roman trees.
- Double Roman domination and domatic numbers of graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Domination in graphs with minimum degree two
- Double Roman domination
- Double Roman domination in trees
- On the double Roman domination in graphs
- Double Roman domination and domatic numbers of graphs
- Bounds on the locating Roman domination number in trees
- The distance Roman domatic number of a graph
Cited In (29)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Double Roman domination subdivision number in graphs
- 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
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- New results on quadruple Roman domination in graphs
- Algorithmic results on double Roman domination in graphs
- Signed double Roman domination in graphs
- Properties of double Roman domination on cardinal products of graphs
- Outer independent signed double Roman domination
- Outer independent double Roman domination
- Double Roman domination in generalized Petersen graphs
- Perfect double Roman domination of trees
- Domination parameters of generalized Sierpiński graphs
- Extremal digraphs for an upper bound on the double Roman domination number
- Varieties of Roman Domination
- Lower and upper bounds on independent double Roman domination in trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on signed total double Roman domination
- Integer linear programming formulations for double roman domination problem
- On the global double Roman domination of graphs
- Disprove of a conjecture on the double Roman domination number
- The double Roman domination number of generalized Sierpiński graphs
- Title not available (Why is that?)
- An improved upper bound on the independent double Roman domination number of trees
- Independent double Roman domination in graphs
- Independent double Roman domination in graphs
- Bounds for signed double Roman k-domination in trees
This page was built for publication: An upper bound on the double Roman domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895065)
