Algorithmic results on double Roman domination in graphs
From MaRDI portal
Publication:2292130
DOI10.1007/s10878-019-00457-3zbMath1434.05105OpenAlexW2980417459WikidataQ126992400 ScholiaQ126992400MaRDI QIDQ2292130
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00457-3
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Double Roman domination in generalized Petersen graphs ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ A linear-time algorithm for weighted paired-domination on block graphs ⋮ Unique response Roman domination: complexity and algorithms ⋮ Unnamed Item ⋮ Algorithm and hardness results in double Roman domination of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- A linear time recognition algorithm for proper interval graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The complexity of domination problems in circle graphs
- Roman domination in graphs.
- Some progress on the double Roman domination in graphs
- Double Roman domination in trees
- Signed double Roman domination in graphs
- A characterization of double Roman trees
- Double Roman domination number
- Defending the Roman Empire---a new strategy
- The weighted perfect domination problem and its variants
- On the double Roman domination of graphs
- On the double Roman domination in graphs
- Signed Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A Greedy Heuristic for the Set-Covering Problem
- Double Roman domination and domatic numbers of graphs
- Global double Roman domination in graphs
- Analytical approach to parallel repetition
- An upper bound on the double Roman domination number
This page was built for publication: Algorithmic results on double Roman domination in graphs
