Recommendations
Cited in
(24)- Secure Italian domination in graphs
- Italian domination of Cartesian products of directed cycles
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Efficient \((j, k)\)-dominating functions
- Total Roman \(\{2\}\)-dominating functions in graphs
- Bounds on the double Italian domination number of a graph
- Graphs with large Italian domination number
- Italian domination in rooted product graphs
- From the strong differential to Italian domination in graphs
- Perfect Italian domination in cographs
- Graphs with small Italian domatic number
- Varieties of Roman Domination
- Bounds on the outer-independent double Italian domination number
- On the outer-independent double Italian domination number
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- Italian domination in trees
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs
- Italian, 2-rainbow and Roman domination numbers in middle graphs
- An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two
- On the SD number and the ID number of generalized hypercube networks
- Characterizations of Italian graphs and Sicilian graphs
- On the algorithmic complexity of Roman \(\{2\}\)-domination (Italian domination)
- Constructive characterizations concerning weak Roman domination in trees
This page was built for publication: Roman, Italian, and 2-domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243996)
