Independent double Roman domination in graphs
From MaRDI portal
Recommendations
Cites work
- A note on the independent Roman domination in unicyclic graphs
- An upper bound on the double Roman domination number
- Bounds on Roman domination numbers of graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in trees
- Extremal problems for roman domination
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 6889679 (Why is no real title available?)
- scientific article; zbMATH DE number 6769213 (Why is no real title available?)
- Independent domination in graphs: A survey and recent results
- On the Roman domination number of a graph
- Properties of independent Roman domination in graphs
- Roman domination in graphs.
Cited in
(23)- Some progress on the double Roman domination in graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- A new approach on locally checkable problems
- On the independent double Roman domination in graphs
- Outer independent double Roman domination
- On the double Roman domination in graphs
- Complexity aspects of variants of independent Roman domination in graphs
- Independent double Roman domination in graphs
- Varieties of Roman domination. II
- Lower and upper bounds on independent double Roman domination in trees
- A note on the Italian domination number and double Roman domination number in graphs
- Quadruple Roman domination in graphs
- An upper bound on the double Roman domination number
- Independent Roman bondage of graphs
- On the outer independent total double Roman domination in graphs
- An improved upper bound on the independent double Roman domination number of trees
- Further results on independent double roman trees
- On the double Roman bondage numbers of graphs
- Roman domination and independent Roman domination on graphs with maximum degree three
- Inverse double Roman domination in graphs
- On \(d\)-stable locally checkable problems parameterized by mim-width
- Independent double Roman domination number of a tree in terms of its 2-independence number
- Independent \([k]\)-Roman domination on graphs
This page was built for publication: Independent double Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304392)