A note on Roman domination of digraphs
From MaRDI portal
Publication:1630917
DOI10.7151/dmgt.2067zbMath1401.05219OpenAlexW2796060732WikidataQ130035764 ScholiaQ130035764MaRDI QIDQ1630917
Guoliang Hao, Xiaodan Chen, Zhihong Xie
Publication date: 5 December 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2067
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
The Roman domatic problem in graphs and digraphs: a survey ⋮ Unique response Roman domination: complexity and algorithms ⋮ Roman domination in oriented trees ⋮ Total Roman domination in digraphs ⋮ Extremal digraphs for an upper bound on the Roman domination number
Cites Work
- Strong equality of Roman and weak Roman domination in trees
- Roman domination on strongly chordal graphs
- Directed domination in oriented graphs
- On the difference of the domination number of a digraph and of its reverse
- On the roman domination in the lexicographic product of graphs
- Signed Roman domination in digraphs
- Signed total Roman domination in digraphs
- Upper bounds on Roman domination numbers of graphs
- A note on Roman domination in graphs
- Roman domination in regular graphs
- Strong equality between the Roman domination and independent Roman domination numbers in trees
- Extremal Problems for Roman Domination
- Dominating Set and Converse Dominating Set of a Directed Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on Roman domination of digraphs
