Total Roman domination in digraphs
From MaRDI portal
Publication:4986528
DOI10.2989/16073606.2019.1692091zbMath1462.05278OpenAlexW2990806088WikidataQ126647876 ScholiaQ126647876MaRDI QIDQ4986528
Wei Zhuang, Kangxiu Hu, Guoliang Hao
Publication date: 27 April 2021
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073606.2019.1692091
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- Roman domination in regular graphs
- Roman domination in graphs.
- A note on Roman domination of digraphs
- Nordhaus-Gaddum bounds for total Roman domination
- On the Roman domination stable graphs
- Extremal Problems for Roman Domination
- Total $k$-Rainbow domination numbers in graphs
- Total domination in digraphs
- A note on lower bounds for the total domination number of digraphs
- Lower bounds on the Roman and independent Roman domination numbers
- Total Roman domination in graphs
- Dominating Set and Converse Dominating Set of a Directed Graph
This page was built for publication: Total Roman domination in digraphs