Double Roman domination in digraphs
From MaRDI portal
Publication:2272602
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- Bounds on the domination number of a digraph
- Directed domination in oriented graphs
- Dominating Set and Converse Dominating Set of a Directed Graph
- Double Roman domination
- Extremal problems for roman domination
- Independent rainbow domination of graphs
- Lower bounds on the roman and independent roman domination numbers
- Lower bounds on the signed domination numbers of directed graphs
- On the difference of the domination number of a digraph and of its reverse
- Signed Roman domination in graphs
- Signed domination and signed domatic numbers of digraphs
- Signed domination numbers of directed graphs
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- The Roman domination number of a digraph
Cited in
(12)- The double Roman domination number of generalized Sierpiński graphs
- Signed double Roman domination numbers in digraphs
- A note on Roman domination of digraphs
- Domination parameters of generalized Sierpiński graphs
- Total double Roman domination numbers in digraphs
- Double Italian and double Roman domination in digraphs
- Total Roman domination in digraphs
- The Roman domatic problem in graphs and digraphs: a survey
- Extremal digraphs for an upper bound on the double Roman domination number
- The double Roman domatic number of a digraph
- A note on Roman \(\{2\}\)-domination in digraphs.
- Integer linear programming formulations for double Roman domination problem
This page was built for publication: Double Roman domination in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272602)