On the double Roman domination of graphs
DOI10.1016/J.AMC.2018.06.033zbMATH Open1427.05171OpenAlexW2883391582MaRDI QIDQ2335792FDOQ2335792
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
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- Complement reducible graphs
- Roman domination in graphs.
- Roman \(\{2 \}\)-domination
- Random graphs.
- Extremal problems for roman domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- On Complementary Graphs
- A Linear Recognition Algorithm for Cographs
- Double Roman domination
- Title not available (Why is that?)
- On the \([1,2]\)-domination number of generalized Petersen graphs
- Coupon coloring of some special graphs
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- Double Roman domination in trees
- On the double Roman domination in graphs
- Mixed Roman domination in graphs
- Note on the perfect EIC-graphs
- Coupon coloring of cographs
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
Cited In (28)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Critical concept for double Roman domination in graphs
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Percolation behaviors of partially edge-coupled interdependent networks
- 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
- Algorithmic aspects of Roman graphs
- Double Roman domination
- Integer linear programming models for the weighted total domination problem
- Unique response Roman domination: complexity and algorithms
- Perfect Italian domination in cographs
- Perfect double Roman domination of trees
- Quasi total double Roman domination in graphs
- Extremal digraphs for an upper bound on the double Roman domination number
- The restrained double Roman domination in graphs
- Some progress on the restrained Roman domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
