Italian domination in trees
From MaRDI portal
Publication:516889
DOI10.1016/J.DAM.2016.09.035zbMATH Open1358.05218OpenAlexW2538779430MaRDI QIDQ516889FDOQ516889
Authors: Michael A. Henning, William F. Klostermeyer 
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.035
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (56)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- On the total restrained double Italian domination
- Perfect Italian domination on some generalizations of cographs
- The Italian domination numbers of some generalized Sierpiński networks
- Domination parameters of generalized Sierpiński graphs
- Further results on (total) restrained Italian domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the double Roman domination in graphs
- A constructive characterization of vertex cover Roman trees
- Italian domination and perfect Italian domination on Sierpiński graphs
- On the outer-independent double Italian domination number
- Efficient \((j, k)\)-dominating functions
- On the Roman {2}-domatic number of graphs
- A characterization of double Roman trees
- Perfect double Italian domination of a graph
- Italian domination in rooted product graphs
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs
- From the strong differential to Italian domination in graphs
- Rainbow Domination in Graphs
- On the Italian reinforcement number of a digraph
- Italian domination in the Cartesian product of paths
- Secure Italian domination in graphs
- Graphs with equal domination and covering numbers
- Global italian domination in graphs
- Italian domination of Cartesian products of directed cycles
- Total Roman \(\{2\}\)-reinforcement of graphs
- Triple Roman domination in graphs
- Total protection of lexicographic product graphs
- Graphs with large Italian domination number
- ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES
- Bounds on the double Italian domination number of a graph
- Perfect Italian domination in graphs: complexity and algorithms
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Perfect Italian domination on planar and regular graphs
- A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers
- Outer independent double Italian domination: Complexity, characterization
- Further results on the signed Italian domination
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS
- Unique response Roman domination: complexity and algorithms
- Perfect Italian domination in cographs
- Approximation algorithm for (connected) Italian dominating function
- Constructive characterizations concerning weak Roman domination in trees
- From Italian domination in lexicographic product graphs to w-domination in graphs
- Bounds on the co-Roman domination number in graphs
- Title not available (Why is that?)
- Varieties of Roman Domination
- Roman \(\{2\}\)-domination problem in graphs
- Perfect Italian domination in trees
- Graphs with small Italian domatic number
- Total Roman {2}-domination in graphs
- On the independent double Roman domination in graphs
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Independent double Roman domination in graphs
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
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)
