Italian domination in trees
From MaRDI portal
Publication:516889
Recommendations
Cites work
Cited in
(58)- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- Italian, 2-rainbow and Roman domination numbers in middle graphs
- Further results on (total) restrained Italian domination
- On the total restrained double Italian domination
- Domination parameters of generalized Sierpiński graphs
- Perfect Italian domination on some generalizations of cographs
- The Italian domination numbers of some generalized Sierpiński networks
- Perfect Italian domination in cographs
- Perfect double Italian domination of a graph
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- Bounds on the double Italian domination number of a graph
- Perfect Italian domination in graphs: complexity and algorithms
- Independent double Roman domination in graphs
- scientific article; zbMATH DE number 7527889 (Why is no real title available?)
- On the independent double Roman domination in graphs
- Triple Roman domination in graphs
- Rainbow domination in graphs
- Constructive characterizations concerning weak Roman domination in trees
- Approximation algorithm for (connected) Italian dominating function
- Varieties of Roman Domination
- Total Roman \(\{2\}\)-reinforcement of graphs
- Trees with equal Roman \{2\}-domination number and independent Roman \{2\}-domination number
- Further results on the signed Italian domination
- Italian domination of Cartesian products of directed cycles
- Perfect Italian domination in trees
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS
- Italian domination in rooted product graphs
- On the Italian reinforcement number of a digraph
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Total protection of lexicographic product graphs
- Unique response Roman domination: complexity and algorithms
- Efficient \((j, k)\)-dominating functions
- Perfect Italian domination on planar and regular graphs
- Italian domination in the Cartesian product of paths
- Secure Italian domination in graphs
- ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES
- Bounds on the outer-independent double Italian domination number
- On the Roman \(\{2\}\)-domatic number of graphs
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs
- Starred Italian domination in graphs
- Italian domination and perfect Italian domination on Sierpiński graphs
- Graphs with equal domination and covering numbers
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
- Roman, Italian, and 2-domination
- From the strong differential to Italian domination in graphs
- Graphs with small Italian domatic number
- Graphs with large Italian domination number
- Global italian domination in graphs
- On the outer-independent double Italian domination number
- A characterization of double Roman trees
- On the double Roman domination in graphs
- Roman \(\{2\}\)-domination problem in graphs
- A constructive characterization of vertex cover Roman trees
- Bounds on the co-Roman domination number in graphs
- Outer independent double Italian domination: Complexity, characterization
- Total Roman \(\{2\}\)-domination in graphs
This page was built for publication: Italian domination in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516889)
