Double Roman domination in trees

DOI10.1016/J.IPL.2018.01.004MaRDI QIDQ1707975zbMATH OpenOpenAlexFDO

Authors Xiujun Zhang, Zepeng Li, Huiqin Jiang, Zehui Shao

Publication date 4 April 2018

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.01.004

zbMATH Keywords

treedomination numberRoman dominationcombinatorial problemsdouble Roman domination number

Mathematics Subject Classification ID

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

Recommendations

• Characterization of double Roman trees.
• Double Roman domination and domatic numbers of graphs
• A characterization of double Roman trees
• Double Roman trees.
• Some properties of double Roman domination

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• A characterization of Roman trees
• Double Roman domination
• On the signed Roman \(k\)-domination: complexity and thin torus graphs

Cited in

(45)

• Independent double Roman domination in graphs
• On the outer independent double Roman domination number
• 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
• A characterization of double Roman trees
• Double Roman trees.
• On [ k ] -Roman domination in graphs
• Critical concept for double Roman domination in graphs
• On algorithmic complexity of double Roman domination
• Trees with vertex-edge Roman domination number twice the domination number minus one
• Algorithmic results on double Roman domination in graphs
• An upper bound on the double Roman domination number
• Signed double Roman domination in graphs
• The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
• Integer linear programming formulations for double Roman domination problem
• Signed double Roman \(k\)-domination in graphs
• Bounds for signed double Roman
• Algorithm and hardness results in double Roman domination of graphs
• Outer independent signed double Roman domination
• Solving the minimum-cost double Roman domination problem
• Double Roman domination in graphs: algorithmic complexity
• Outer independent double Roman domination
• Global double Roman domination in graphs
• Triple Roman domination in graphs
• The unique response Roman domination in trees
• Double Roman domination in generalized Petersen graphs
• The double Roman domatic number of a digraph
• Algorithmic aspects of Roman graphs
• Outer independent double Italian domination: Complexity, characterization
• Unique response Roman domination: complexity and algorithms
• Perfect double Roman domination of trees
• An upper bound on the double Roman domination number
• Extremal digraphs for an upper bound on the double Roman domination number
• The restrained double Roman domination in graphs
• Varieties of Roman Domination
• Lower and upper bounds on independent double Roman domination in trees
• Characterization of double Roman trees.
• Some properties of double Roman domination
• On the global double Roman domination of graphs
• A linear algorithm for double Roman domination of proper interval graphs
• On the independent double Roman domination in graphs
• Total double Roman domination in 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: Double Roman domination in trees

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