Italian domination in trees
From MaRDI portal
Publication:516889
DOI10.1016/J.DAM.2016.09.035zbMath1358.05218OpenAlexW2538779430MaRDI QIDQ516889
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
Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (49)
Italian domination and perfect Italian domination on Sierpiński graphs ⋮ On the Italian reinforcement number of a digraph ⋮ On the outer-independent double Italian domination number ⋮ A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers ⋮ Total protection of lexicographic product graphs ⋮ Unnamed Item ⋮ 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 ⋮ ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES ⋮ Triple Roman domination in graphs ⋮ Perfect Italian domination in cographs ⋮ On the double Roman domination in graphs ⋮ On the computational complexity of Roman\(\{2\}\)-domination in grid graphs ⋮ Unique response Roman domination: complexity and algorithms ⋮ Approximation algorithm for (connected) Italian dominating function ⋮ Roman \(\{ 3 \}\)-domination (double Italian domination) ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ On the independent double Roman domination in graphs ⋮ Perfect double Italian domination of a graph ⋮ Perfect Italian domination on planar and regular graphs ⋮ EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS ⋮ Graphs with small Italian domatic number ⋮ Graphs with large Italian domination number ⋮ A constructive characterization of vertex cover Roman trees ⋮ Independent double Roman domination in graphs ⋮ Unnamed Item ⋮ Italian domination in rooted product graphs ⋮ A characterization of double Roman trees ⋮ Perfect Italian domination in trees ⋮ From the strong differential to Italian domination in graphs ⋮ Unnamed Item ⋮ Italian domination in the Cartesian product of paths ⋮ Secure Italian domination in graphs ⋮ Italian domination of Cartesian products of directed cycles ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ Graphs with equal domination and covering numbers ⋮ Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs ⋮ Varieties of Roman Domination ⋮ Rainbow Domination in Graphs ⋮ Further results on the signed Italian domination ⋮ Bounds on the co-Roman domination number in graphs ⋮ Total Roman {2}-domination in graphs ⋮ Global italian domination in graphs ⋮ Constructive characterizations concerning weak Roman domination in trees ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number ⋮ Efficient \((j, k)\)-dominating functions ⋮ On the Roman {2}-domatic number of graphs ⋮ Roman \(\{2\}\)-domination problem in graphs
Cites Work
This page was built for publication: Italian domination in trees
