Perfect Italian domination on planar and regular graphs
From MaRDI portal
Publication:2197486
DOI10.1016/j.dam.2020.05.024zbMath1450.05066arXiv1905.06293OpenAlexW3044925268MaRDI QIDQ2197486
Juho Lauri, Christodoulos Mitillos
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.06293
Related Items (3)
Italian domination and perfect Italian domination on Sierpiński graphs ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Varieties of Roman Domination
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Fair domination in graphs
- Italian domination in trees
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Efficient algorithms for Roman domination on some classes of graphs
- Roman domination in graphs.
- Perfect Italian domination in trees
- House of Graphs: a database of interesting graphs
- Threshold graphs and related topics
- Generalized perfect domination in graphs
- \([1,2\)-sets in graphs]
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Extremal Problems for Roman Domination
- Planar 3DM is NP-complete
- Fast generation of regular graphs and construction of cages
- Induced Matchings in Subcubic Graphs
- An Annotated Glossary of Graph Theory Parameters, with Conjectures
This page was built for publication: Perfect Italian domination on planar and regular graphs
