Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
From MaRDI portal
Publication:5074890
DOI10.1080/09728600.2022.2059415zbMath1493.05220OpenAlexW4224240428MaRDI QIDQ5074890
Publication date: 10 May 2022
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2022.2059415
Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- Dominating sets in social network graphs
- Roman domination in graphs.
- Total Roman \(\{2\}\)-reinforcement of graphs
- Total Roman reinforcement in graphs
- Triple Roman domination in graphs
- On the total and strong version for Roman dominating functions in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Total $k$-Rainbow domination numbers in graphs
- Total Domination in Graphs
- Total Roman domination subdivision number in graphs
- A characterization relating domination, semitotal domination and total Roman domination in trees
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- Total Roman domination in graphs
This page was built for publication: Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties