Algorithmic aspects of Roman graphs
From MaRDI portal
Publication:4956471
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A characterization of Roman trees
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Double Roman domination
- Double Roman domination in trees
- Efficient algorithms for Roman domination on some classes of graphs
- On the double Roman domination in graphs
- On the double Roman domination of graphs
- Roman \(\{2 \}\)-domination
- Roman domination in graphs.
- Some progress on the double Roman domination in graphs
Cited in
(8)- Efficient algorithms for Roman domination on some classes of graphs
- Computing Roman domatic number of graphs
- Computing strong Roman domination of trees and unicyclic graphs in linear time
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Graph-Theoretic Concepts in Computer Science
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- On algorithmic complexity of double Roman domination
- Roman domination in unicyclic graphs
This page was built for publication: Algorithmic aspects of Roman graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956471)
