Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
From MaRDI portal
Recommendations
Cites work
- A characterization of Roman trees
- Algorithms and Computation
- Counting independent sets in tree convex bipartite graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire from multiple attacks
- Defending the Roman Empire---a new strategy
- Efficient algorithms for Roman domination on some classes of graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On the Roman domination number of a graph
- Quasi-total Roman domination in graphs
- Roman domination in graphs.
- Roman domination perfect graphs
- The Complexity of the Partial Order Dimension Problem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Threshold graphs and related topics
Cited in
(12)- Nearly tight approximation algorithm for (connected) Roman dominating set
- Quasi-total Roman domination in graphs
- Exact Algorithms for Weak Roman Domination
- Algorithmic complexity of weakly connected Roman domination in graphs
- Efficient algorithms for independent Roman domination on some classes of graphs
- Quasi-total Roman bondage number in graphs
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- Quasi-total Roman reinforcement in graphs
- Quasi total double Roman domination in trees
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- Quasi total double Roman domination in graphs
- Complexity issues concerning the quadruple Roman domination problem in graphs
This page was built for publication: Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158956)
