Total double Roman domination numbers in digraphs
From MaRDI portal
Publication:5101908
DOI10.1142/S1793830922500148zbMath1493.05131OpenAlexW3203928300MaRDI QIDQ5101908
Fatemeh Pourhosseini, Jafar Amjadi
Publication date: 2 September 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500148
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Double Roman domination
- Signed double Roman domination in graphs
- The Roman domatic problem in graphs and digraphs: a survey
- Double Roman domination in digraphs
- Outer independent double Roman domination
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- Triple Roman domination in graphs
- Double Roman domination and domatic numbers of graphs
- Total Roman domination in digraphs
- Total double Roman domination in graphs
- Dominating Set and Converse Dominating Set of a Directed Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Total double Roman domination numbers in digraphs
