Perfect Italian domination in cographs
From MaRDI portal
Publication:2661056
DOI10.1016/j.amc.2020.125703zbMath1462.05269OpenAlexW3092428464MaRDI QIDQ2661056
Publication date: 1 April 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125703
Related Items (4)
Perfect Italian domination in graphs: complexity and algorithms ⋮ Unique response Roman domination: complexity and algorithms ⋮ The restrained double Roman domination in graphs ⋮ Perfect double Italian domination of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Coupon coloring of some special graphs
- Italian domination in trees
- Complement reducible graphs
- Roman domination in graphs.
- Perfect Roman domination in trees
- The secure domination problem in cographs
- Coupon coloring of cographs
- Perfect Italian domination in trees
- On the signed Italian domination of graphs
- Graphs with large Italian domination number
- Outer independent double Roman domination
- Note on the perfect Roman domination number of graphs
- Perfect Roman domination in graphs
- On the double Roman domination of graphs
- Signed Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A Linear Recognition Algorithm for Cographs
- Global italian domination in graphs
This page was built for publication: Perfect Italian domination in cographs