Total double Roman domination in graphs
From MaRDI portal
Recommendations
Cites work
- A survey of selected recent results on total domination in graphs
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in trees
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 6815662 (Why is no real title available?)
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Lower bound on the domination number of a tree
- Nordhaus-Gaddum bounds for total Roman domination
- On the double Roman domination in graphs
- Some progress on the double Roman domination in graphs
- Total domination in graphs
- Total domination versus domination in cubic graphs
- Total roman domination in graphs
Cited in
(38)- Double total domination of graphs
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- On the outer independent double Roman domination number
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Triple Roman domination in graphs
- Double Roman domination and domatic numbers of graphs
- Bounds on the outer-independent double Italian domination number
- Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
- Global double Roman domination in graphs
- Total double Roman domination numbers in digraphs
- Restrained double Roman domination of a graph
- Relating total double Roman domination to 2-independence in trees
- Critical concept for double Roman domination in graphs
- Double Roman reinforcement number in graphs
- Quadruple Roman domination in graphs
- On the outer independent total double Roman domination in graphs
- scientific article; zbMATH DE number 7693187 (Why is no real title available?)
- An improved upper bound on the independent double Roman domination number of trees
- Outer independent double Italian domination: Complexity, characterization
- Double Roman domination in graphs: algorithmic complexity
- Quasi total double Roman domination in trees
- Perfect double Italian domination of a graph
- Restrained double Italian domination in graphs
- New results on quadruple Roman domination in graphs
- Inverse double Roman domination in graphs
- On the total restrained double Italian domination
- New bounds on the outer-independent total double Roman domination number
- Weak double Roman domination
- Quasi total double Roman domination in graphs
- Total double Roman domination stability in graphs
- Total Roman domination and total domination in unit disk graphs
- Lower bounds on signed total double Roman k-domination in graphs
- Meta-heuristic algorithms for quasi total double Roman domination problem
- Some results on the global triple Roman domination in graphs
- Bounds on the global double Roman domination number in graphs
- Bounds on the total double Roman domination number of graphs
- Algorithmic aspects of total Roman and total double Roman domination in graphs
This page was built for publication: Total double Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212897)
