Further results on the [k]-Roman domination in graphs
From MaRDI portal
Publication:6563288
Recommendations
- On [ k ] -Roman domination in graphs
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- On [k]-Roman domination subdivision number of graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Some progress on the double Roman domination in graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Algorithmic complexity of triple Roman dominating functions on graphs
- An upper bound on the double Roman domination number
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in generalized Petersen graphs
- Double Roman trees.
- Extremal problems for roman domination
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Mixed Roman domination in graphs
- On [ k ] -Roman domination in graphs
- On the double Roman domination in graphs
- Quadruple Roman domination in graphs
- Roman domination in graphs.
- Triple Roman domination in graphs
Cited in
(8)- On [ k ] -Roman domination in graphs
- Further results on outer independent triple Roman domination
- On a generalization of Roman domination with more legions
- Outer-independent triple Roman domination
- Independent \([k]\)-Roman domination on graphs
- Complexity issues concerning the quadruple Roman domination problem in graphs
- More results on the outer-independent triple Roman domination number
- Perfect triple Roman domination
This page was built for publication: Further results on the \([k]\)-Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563288)