Perfect Roman domination in graphs
DOI10.1016/J.TCS.2019.08.017zbMATH Open1435.05154OpenAlexW2967821251MaRDI QIDQ2333784FDOQ2333784
Authors: Yanyan Li 
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complement reducible graphs
- Roman domination in graphs.
- Roman \(\{2 \}\)-domination
- Planar 3DM is NP-complete
- Signed Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A Linear Recognition Algorithm for Cographs
- Double Roman domination
- A linear time recognition algorithm for proper interval graphs
- Title not available (Why is that?)
- Perfect Roman domination in trees
- A linear algorithm for the domination number of a series-parallel graph
- Perfect Roman domination in regular graphs
Cited In (22)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Double vertex-edge domination in graphs: complexity and algorithms
- On perfect Roman domination number in trees: complexity and bounds
- Total Roman domination for proper interval graphs
- Complexity issues of perfect Roman domination in graphs
- Roman domination on strongly chordal graphs
- On maximal Roman domination in graphs: complexity and algorithms
- Efficient algorithms for Roman domination on some classes of graphs
- 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 graphs: complexity and algorithms
- Note on the perfect Roman domination number of graphs
- Unique response Roman domination: complexity and algorithms
- Perfect Italian domination in cographs
- On the computational complexity aspects of perfect Roman domination
- Perfect Roman domination in middle graphs
- The restrained double Roman domination in graphs
- Perfect Roman domination in regular graphs
- Perfect Roman domination in trees
- On the perfect differential of a graph
- Roman domination perfect graphs
- Domination problems on \(P_{5}\)-free graphs
This page was built for publication: Perfect Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333784)
