Double Roman domination in digraphs
DOI10.1007/S40840-017-0582-9zbMATH Open1419.05091OpenAlexW2769897350MaRDI QIDQ2272602FDOQ2272602
Authors: Guoliang Hao, Xiaodan Chen, Lutz Volkmann
Publication date: 20 September 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-017-0582-9
Recommendations
digraphRoman dominationdouble Roman dominationsigned domination\(k\)-dominationNordhaus-Gaddum-type inequality
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Extremal problems for roman domination
- Signed Roman domination in graphs
- Lower bounds on the signed domination numbers of directed graphs
- Bounds on the domination number of a digraph
- Signed domination and signed domatic numbers of digraphs
- Signed domination numbers of directed graphs
- Title not available (Why is that?)
- The Roman domination number of a digraph
- Double Roman domination
- Directed domination in oriented graphs
- Dominating Set and Converse Dominating Set of a Directed Graph
- On the difference of the domination number of a digraph and of its reverse
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- Independent rainbow domination of graphs
- Lower bounds on the roman and independent roman domination numbers
Cited In (12)
- The Roman domatic problem in graphs and digraphs: a survey
- Integer linear programming formulations for double Roman domination problem
- A note on Roman domination of digraphs
- Signed double Roman domination numbers in digraphs
- A note on Roman \(\{2\}\)-domination in digraphs.
- Double Italian and double Roman domination in digraphs
- The double Roman domatic number of a digraph
- Domination parameters of generalized Sierpiński graphs
- Extremal digraphs for an upper bound on the double Roman domination number
- Total Roman domination in digraphs
- The double Roman domination number of generalized Sierpiński graphs
- Total double Roman domination numbers in digraphs
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)