Perfect Italian domination in graphs: complexity and algorithms
From MaRDI portal
Publication:2161253
DOI10.1016/j.dam.2021.08.020zbMath1496.05134OpenAlexW3197605098MaRDI QIDQ2161253
Publication date: 4 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.08.020
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Italian domination in trees
- Roman domination in graphs.
- Perfect Roman domination in trees
- Perfect Italian domination in trees
- A linear algorithm for the domination number of a series-parallel graph
- The weighted perfect domination problem and its variants
- Perfect Italian domination on planar and regular graphs
- Graphs with large Italian domination number
- Outer independent double Roman domination
- Algorithmic results on double Roman domination in graphs
- Perfect Roman domination in graphs
- Signed Roman domination in graphs
- Perfect Italian domination in cographs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Outer independent Roman dominating functions in graphs
- Total Domination in Graphs
- Italian domination on Mycielskian and Sierpinski graphs
- Italian domination and perfect Italian domination on Sierpiński graphs
- Topics in Domination in Graphs
- The complexity of theorem-proving procedures
This page was built for publication: Perfect Italian domination in graphs: complexity and algorithms
