Roman domination perfect graphs
From MaRDI portal
Recommendations
Cited in
(28)- Perfect Roman domination in trees
- A characterization of double Roman trees
- Perfect Italian domination in trees
- Algorithmic aspects of Roman domination in graphs
- Note on the perfect Roman domination number of graphs
- Complexity aspects of variants of independent Roman domination in graphs
- Trees with independent Roman domination number twice the independent domination number
- Varieties of Roman Domination
- Roman domination excellent graphs: trees
- scientific article; zbMATH DE number 2094533 (Why is no real title available?)
- On Roman domination number of functigraph and its complement
- Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
- Perfect Roman domination in middle graphs
- Complexity issues of perfect Roman domination in graphs
- Algorithmic aspects of outer independent Roman domination in graphs
- Independent Roman \(\{3\}\)-domination
- Restrained Roman domination in graphs
- Perfect Roman domination in regular graphs
- Algorithmic complexity of weakly connected Roman domination in graphs
- A Roman domination chain
- Further results on the independent Roman domination number of graphs
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
- Global restrained Roman domination in graphs
- The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes
- Algorithmic aspects of outer-independent double Roman domination in graphs
- Perfect double Roman domination of trees
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Global Roman domination in graphs
This page was built for publication: Roman domination perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918118)