An upper bound on the double Roman domination number

DOI10.1007/S10878-018-0286-6MaRDI QIDQ5895065zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dominationRoman dominationdouble Roman domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Bounds on the locating Roman domination number in trees
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Defending the Roman Empire---a new strategy
• Domination in graphs with minimum degree two
• Double Roman domination
• Double Roman domination and domatic numbers of graphs
• Double Roman domination in trees
• On the double Roman domination in graphs
• Roman domination in graphs.
• The distance Roman domatic number of a graph

Cited in

(34)

• Independent double Roman domination in graphs
• Roman \(\{3\}\)-domination in graphs: complexity and algorithms
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• On the double Roman domination of graphs
• Double Roman domination subdivision number in graphs
• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• On the double Roman domination number in trees
• Critical concept for double Roman domination in graphs
• New results on quadruple Roman domination in graphs
• Algorithmic results on double Roman domination in graphs
• A note on the double Roman domination number of graphs.
• An upper bound on the double Roman domination number
• Signed double Roman domination in graphs
• Integer linear programming formulations for double Roman domination problem
• Properties of double Roman domination on cardinal products of graphs
• On the differential and Roman domination number of a graph with minimum degree two
• Signed double Roman \(k\)-domination in graphs
• Bounds for signed double Roman
• Outer independent signed double Roman domination
• An upper bound on triple Roman domination
• Outer independent double Roman domination
• Double Roman domination in generalized Petersen graphs
• Perfect double Roman domination of trees
• Extremal digraphs for an upper bound on the double Roman domination number
• Domination parameters of generalized Sierpiński graphs
• Varieties of Roman Domination
• Lower and upper bounds on independent double Roman domination in trees
• scientific article; zbMATH DE number 7478539 (Why is no real title available?)
• Bounds on signed total double Roman domination
• 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
• Independent double Roman domination in graphs
• An improved upper bound on the independent double Roman domination number of 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)