Perfect Italian domination in trees
From MaRDI portal
Publication:1741510
DOI10.1016/j.dam.2019.01.038zbMath1409.05148OpenAlexW2917837588MaRDI QIDQ1741510
Michael A. Henning, Teresa W. Haynes
Publication date: 3 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.038
Related Items (16)
Italian domination and perfect Italian domination on Sierpiński graphs ⋮ On the Italian reinforcement number of a digraph ⋮ Total protection of lexicographic product graphs ⋮ A new upper bound for the perfect Italian domination number of a tree ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Perfect Italian domination in cographs ⋮ Unique response Roman domination: complexity and algorithms ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ Perfect double Italian domination of a graph ⋮ Perfect Italian domination on planar and regular graphs ⋮ Unnamed Item ⋮ Italian domination in the Cartesian product of paths ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ Varieties of Roman Domination ⋮ Perfect double Roman domination of trees ⋮ Efficient \((j, k)\)-dominating functions
Cites Work
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Roman domination on strongly chordal graphs
- Roman domination number of the Cartesian products of paths and cycles
- Italian domination in trees
- Upper bounds on Roman domination numbers of graphs
- Roman domination in graphs.
- Perfect Roman domination in trees
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman Domination on 2-Connected Graphs
- Extremal Problems for Roman Domination
- A characterization of Roman trees
- Total Domination in Graphs
- A Taxonomy of Perfect Domination
- Roman domination in Cartesian product graphs and strong product graphs
- Protecting a graph with mobile guards
This page was built for publication: Perfect Italian domination in trees
