On the double Roman domination of graphs

DOI10.1016/j.amc.2018.06.033zbMath1427.05171OpenAlexW2883391582MaRDI QIDQ2335792

Min Li, Guodong Liu, Meiqin Wei, Jun Yue

Publication date: 15 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.06.033

zbMATH Keywords

algorithmdouble Roman dominationcographdouble Roman domination numberNordhaus-Gaddum type problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (19)

Integer linear programming formulations for double roman domination problem ⋮ Outer independent signed double Roman domination ⋮ Perfect Italian domination in cographs ⋮ Unique response Roman domination: complexity and algorithms ⋮ The restrained double Roman domination in graphs ⋮ On algorithmic complexity of double Roman domination ⋮ Some progress on the restrained Roman domination ⋮ Integer linear programming models for the weighted total domination problem ⋮ Outer independent double Roman domination ⋮ Domination in hexagonal chains ⋮ Algorithmic results on double Roman domination in graphs ⋮ A linear algorithm for double Roman domination of proper interval graphs ⋮ Extremal digraphs for an upper bound on the double Roman domination number ⋮ Perfect double Roman domination of trees ⋮ Percolation behaviors of partially edge-coupled interdependent networks ⋮ Critical concept for double Roman domination in graphs ⋮ Restrained condition on double Roman dominating functions ⋮ ALGORITHMIC ASPECTS OF ROMAN GRAPHS ⋮ Algorithm and hardness results in double Roman domination of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Double Roman domination
• Coupon coloring of some special graphs
• Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
• Complement reducible graphs
• Roman domination in graphs.
• Mixed Roman domination in graphs
• Double Roman domination in trees
• Note on the perfect EIC-graphs
• Coupon coloring of cographs
• On the double Roman domination in graphs
• On the \([1,2\)-domination number of generalized Petersen graphs]
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• On Complementary Graphs
• Extremal Problems for Roman Domination
• A Linear Recognition Algorithm for Cographs
• 2-edge connected dominating sets and 2-connected dominating sets of a graph

This page was built for publication: On the double Roman domination of graphs