Total Roman domatic number of a graph
From MaRDI portal
Publication:4985437
DOI10.1142/S1793557120501107zbMATH Open1458.05184OpenAlexW2926139741WikidataQ128123680 ScholiaQ128123680MaRDI QIDQ4985437FDOQ4985437
Authors: J. Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmood Sheikholeslami 
Publication date: 23 April 2021
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557120501107
Recommendations
Cites Work
- Title not available (Why is that?)
- Roman domination in graphs.
- Extremal problems for roman domination
- Total domination in graphs
- On the Roman domination number of a graph
- Roman domination on strongly chordal graphs
- Total roman domination in graphs
- Title not available (Why is that?)
- On the total Roman domination in trees
- Title not available (Why is that?)
- Global total Roman domination in graphs
- Nordhaus-Gaddum bounds for total Roman domination
- Total Roman reinforcement in graphs
Cited In (9)
- The Roman domatic problem in graphs and digraphs: a survey
- Computing Roman domatic number of graphs
- The roman domatic number of a graph
- Roman and total domination
- Total Italian domatic number of graphs
- Some new results on the \(b\)-domatic number of graphs
- The distance Roman domatic number of a graph
- On the total and strong version for Roman dominating functions in graphs
- Title not available (Why is that?)
This page was built for publication: Total Roman domatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985437)
