Algorithmic complexity of triple Roman dominating functions on graphs
From MaRDI portal
Recommendations
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Algorithmic aspects of Roman domination in graphs
- Algorithmic aspects of Roman \(\{3\}\)-domination in graphs
- Algorithmic results on double Roman domination in graphs
- Complexity issues concerning the quadruple Roman domination problem in graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Approximation hardness of dominating set problems in bounded degree graphs
- Counting independent sets in tree convex bipartite graphs
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Global triple Roman dominating function
- Optimal greedy algorithms for indifference graphs
- Optimization, approximation, and complexity classes
- Secure domination in proper interval graphs
- Some APX-completeness results for cubic graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Total Roman \(\{2\}\)-dominating functions in graphs
- Triple Roman domination in graphs
- Triple Roman domination subdivision number in graphs
Cited in
(10)- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Further results on the \([k]\)-Roman domination in graphs
- Some results on the global triple Roman domination in graphs
- Further results on outer independent triple Roman domination
- Outer-independent triple Roman domination
- Complexity issues concerning the quadruple Roman domination problem in graphs
- More results on the outer-independent triple Roman domination number
- Total Roman domination and total domination in unit disk graphs
- Perfect triple Roman domination
- The triple Roman domination stability in graphs
This page was built for publication: Algorithmic complexity of triple Roman dominating functions on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150942)
