Total Roman domination subdivision number in graphs
From MaRDI portal
Publication:4957524
DOI10.22049/cco.2020.26470.1117zbMath1488.05359OpenAlexW3005478270MaRDI QIDQ4957524
Publication date: 9 September 2021
Full work available at URL: https://doaj.org/article/ea7fe0a52f554c688dc7b3fa4b76e29b
Related Items (max. 100)
Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Triple Roman domination subdivision number in graphs ⋮ On [k-Roman domination subdivision number of graphs] ⋮ Quasi-total Roman reinforcement in graphs ⋮ Double Roman domination subdivision number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- Roman domination subdivision number of graphs
- Bounding the total domination subdivision number of a graph in terms of its order
- Total domination and total domination subdivision number of a graph and its complement
- Domination subdivision numbers of trees
- 2-domination subdivision number of graphs
- The bondage number of a graph
- Roman domination in graphs.
- Nordhaus-Gaddum bounds for total Roman domination
- On the total Roman domination in trees
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- New bounds on the rainbow domination subdivision number
- Domination Subdivision Numbers
- Total domination subdivision numbers of graphs
- Total Domination in Graphs
- The convex domination subdivision number of a graph
- Weakly convex domination subdivision number of a graph
- Total Roman domination in graphs
This page was built for publication: Total Roman domination subdivision number in graphs