Perfect Roman domination in graphs
From MaRDI portal
Publication:2333784
DOI10.1016/j.tcs.2019.08.017zbMath1435.05154OpenAlexW2967821251MaRDI QIDQ2333784
Publication date: 13 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.017
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
On the perfect differential of a graph ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ A linear-time algorithm for weighted paired-domination on block graphs ⋮ Perfect Italian domination in cographs ⋮ Unique response Roman domination: complexity and algorithms ⋮ The restrained double Roman domination in graphs ⋮ Unnamed Item ⋮ Double vertex-edge domination in graphs: complexity and algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- A linear time recognition algorithm for proper interval graphs
- Complement reducible graphs
- Roman domination in graphs.
- Perfect Roman domination in trees
- A linear algorithm for the domination number of a series-parallel graph
- Signed Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A Linear Recognition Algorithm for Cographs
- Planar 3DM is NP-complete
- Perfect roman domination in regular graphs
This page was built for publication: Perfect Roman domination in graphs
