Unique response strong Roman dominating functions of graphs
From MaRDI portal
Publication:5061702
Recommendations
- Trees with strong equality between the roman domination number and the unique response Roman domination number
- Unique response Roman domination in graphs
- The unique response Roman domination in trees
- Trees with equal strong Roman domination number and Roman domination number
- Lower and upper bounds on the strong Roman dominator number in graphs
Cites work
- A new graph product and its spectrum
- A note on the edge Roman domination in trees
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On the distance domination number of bipartite graphs
- On the signed 2-independence number of graphs
- On the strong Roman domination number of graphs
- On the total and strong version for Roman dominating functions in graphs
- Roman dominating influence parameters
- Total Roman domination for proper interval graphs
- Trees with equal strong Roman domination number and Roman domination number
Cited in
(6)- Computing strong Roman domination of trees and unicyclic graphs in linear time
- Unique response Roman domination in graphs
- Trees with strong equality between the roman domination number and the unique response Roman domination number
- The unique response Roman domination in trees
- Trees with equal strong Roman domination number and Roman domination number
- Global restrained Roman domination in graphs
This page was built for publication: Unique response strong Roman dominating functions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5061702)