On the double Roman domination of graphs

DOI10.1016/J.AMC.2018.06.033MaRDI QIDQ2335792zbMATH OpenOpenAlexFDO

Authors Jun Yue, Meiqin Wei, M. Li, Guodong Liu

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 dominationcographNordhaus-Gaddum type problemdouble Roman domination number

Mathematics Subject Classification ID

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

Recommendations

• A note on the double Roman domination number of graphs.
• Some properties of double Roman domination
• Double Roman domination
• Double Roman domination and domatic numbers of graphs
• An upper bound on the double Roman domination number

Cites work

• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 6769213 (Why is no real title available?)
• 2-edge connected dominating sets and 2-connected dominating sets of a graph
• A Linear Recognition Algorithm for Cographs
• Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
• Complement reducible graphs
• Coupon coloring of cographs
• Coupon coloring of some special graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Double Roman domination
• Double Roman domination in trees
• Extremal problems for roman domination
• Graph theory
• Mixed Roman domination in graphs
• Note on the perfect EIC-graphs
• On Complementary Graphs
• On the \([1,2]\)-domination number of generalized Petersen graphs
• On the double Roman domination in graphs
• Random graphs.
• Roman \(\{2 \}\)-domination
• Roman domination in graphs.

Cited in

(28)

• Roman \(\{3\}\)-domination in graphs: complexity and algorithms
• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• Percolation behaviors of partially edge-coupled interdependent networks
• Critical concept for double Roman domination in graphs
• On algorithmic complexity of double Roman domination
• Algorithmic results on double Roman domination in graphs
• A note on the double Roman domination number of graphs.
• Integer linear programming formulations for double Roman domination problem
• Algorithm and hardness results in double Roman domination of graphs
• Outer independent signed double Roman domination
• Domination in hexagonal chains
• Outer independent double Roman domination
• Restrained double Roman domination of a graph
• Double Roman domination
• Algorithmic aspects of Roman graphs
• Integer linear programming models for the weighted total domination problem
• Unique response Roman domination: complexity and algorithms
• Perfect double Roman domination of trees
• Perfect Italian domination in cographs
• Extremal digraphs for an upper bound on the double Roman domination number
• Quasi total double Roman domination in graphs
• The restrained double Roman domination in graphs
• Some progress on the restrained Roman domination
• scientific article; zbMATH DE number 7478539 (Why is no real title available?)
• scientific article; zbMATH DE number 7693187 (Why is no real title available?)
• Some properties of double Roman domination
• A linear algorithm for double Roman domination of proper interval graphs
• Restrained condition on double Roman dominating functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335792)