On the total and strong version for Roman dominating functions in graphs
From MaRDI portal
Publication:2662879
DOI10.1007/S00010-021-00778-XzbMath1464.05297arXiv1912.01093OpenAlexW3124704196MaRDI QIDQ2662879
Sakineh Nazari-Moghaddam, Marzieh Soroudi, Seyyed Mahmoud Sheikholeslami, Ismael González Yero
Publication date: 15 April 2021
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.01093
Roman dominationtotal dominating setstotal Roman domination numbertotal strong Roman dominating function
Related Items (2)
Unique response strong Roman dominating functions of graphs ⋮ Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- A survey of selected recent results on total domination in graphs
- On graphs having domination number half their order
- Roman domination in graphs.
- Nordhaus-Gaddum bounds for total Roman domination
- On the total Roman domination in trees
- Independent domination in graphs: A survey and recent results
- The Roman domatic problem in graphs and digraphs: a survey
- Quasi-total Roman domination in graphs
- Total Roman reinforcement in graphs
- On the strong Roman domination number of graphs
- Total Roman domination in the lexicographic product of graphs
- Extremal Problems for Roman Domination
- Total domination in graphs
- Domination-balanced graphs
- Total Domination in Graphs
- Varieties of Roman domination II
- Total Roman domination subdivision number in graphs
- Total Roman domatic number of a graph
- Topics in Domination in Graphs
- Roman domination in Cartesian product graphs and strong product graphs
- Total Roman domination in graphs
- Global total Roman domination in graphs
This page was built for publication: On the total and strong version for Roman dominating functions in graphs