Total Roman domination subdivision number in graphs
From MaRDI portal
Publication:4957524
Recommendations
Cites work
- 2-domination subdivision number of graphs
- Bounding the total domination subdivision number of a graph in terms of its order
- Connected domination subdivision numbers of graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Domination Subdivision Numbers
- Domination subdivision numbers of trees
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 6815662 (Why is no real title available?)
- scientific article; zbMATH DE number 6749240 (Why is no real title available?)
- scientific article; zbMATH DE number 975422 (Why is no real title available?)
- New bounds on the rainbow domination subdivision number
- Nordhaus-Gaddum bounds for total Roman domination
- On the total Roman domination in trees
- Roman domination in graphs.
- Roman domination on strongly chordal graphs
- Roman domination subdivision number of graphs
- The bondage number of a graph
- The convex domination subdivision number of a graph
- Total domination and total domination subdivision number of a graph and its complement
- Total domination in graphs
- Total domination subdivision numbers of graphs
- Total roman domination in graphs
- Trees whose Roman domination subdivision number is 2
- Weakly convex domination subdivision number of a graph
Cited in
(17)- On total Roman domination in graphs
- On the total and strong version for Roman dominating functions in graphs
- Roman game domination subdivision number of a graph
- Trees whose Roman domination subdivision number is 2
- On the total Roman domination number of graphs.
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Total Roman domination edge-supercritical and edge-removal-supercritical graphs
- Total roman domination in graphs
- Double Roman domination subdivision number in graphs
- Triple Roman domination subdivision number in graphs
- On [k]-Roman domination subdivision number of graphs
- Quasi-total Roman reinforcement in graphs
- Roman domination subdivision number of graphs
- On maximal Roman domination in graphs: complexity and algorithms
- NP-completeness and bounds for disjunctive total domination subdivision
- On the Roman domination subdivision number of a graph
- Upper bounds for the Roman domination subdivision number of a graph
This page was built for publication: Total Roman domination subdivision number in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957524)
