Double Roman domination in trees
From MaRDI portal
Publication:1707975
DOI10.1016/j.ipl.2018.01.004zbMath1476.05162OpenAlexW2790637388MaRDI QIDQ1707975
Zepeng Li, Xiujun Zhang, Zehui Shao, Huiqin Jiang
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
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (40)
Total double Roman domination in graphs ⋮ Integer linear programming formulations for double roman domination problem ⋮ Lower and upper bounds on independent double Roman domination in trees ⋮ Outer independent signed double Roman domination ⋮ Double Roman domination in generalized Petersen graphs ⋮ On the outer independent double Roman domination number ⋮ Triple Roman domination in graphs ⋮ On the global double Roman domination of graphs ⋮ Unique response Roman domination: complexity and algorithms ⋮ An improved upper bound on the independent double Roman domination number of trees ⋮ The restrained double Roman domination in graphs ⋮ The double Roman domatic number of a digraph ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ Some properties of double Roman domination ⋮ On the independent double Roman domination in graphs ⋮ On [ k -Roman domination in graphs] ⋮ The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ On algorithmic complexity of double Roman domination ⋮ Independent double Roman domination in graphs ⋮ Unnamed Item ⋮ Signed double Roman domination in graphs ⋮ An upper bound on the double Roman domination number ⋮ A characterization of double Roman trees ⋮ An upper bound on the double Roman domination number ⋮ Outer independent double Roman domination ⋮ Algorithmic results on double Roman domination in graphs ⋮ A linear algorithm for double Roman domination of proper interval graphs ⋮ Varieties of Roman Domination ⋮ Independent double Roman domination in graphs ⋮ Extremal digraphs for an upper bound on the double Roman domination number ⋮ Perfect double Roman domination of trees ⋮ Bounds for signed double Roman k-domination in trees ⋮ Unnamed Item ⋮ 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 ⋮ Critical concept for double Roman domination in graphs ⋮ Trees with vertex-edge roman domination number twice the domination number minus one ⋮ ALGORITHMIC ASPECTS OF ROMAN GRAPHS ⋮ Global double Roman domination in graphs ⋮ Algorithm and hardness results in double Roman domination of graphs
Cites Work
This page was built for publication: Double Roman domination in trees
