Secure Italian domination in graphs
From MaRDI portal
Publication:2025095
DOI10.1007/s10878-020-00658-1zbMath1464.05285OpenAlexW3097295197MaRDI QIDQ2025095
Juan Alberto Rodríguez-Velázquez, Magdalena Lemańska, Magda Dettlaff
Publication date: 11 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00658-1
Related Items (1)
Cites Work
- Roman \(\{2 \}\)-domination
- Italian domination in trees
- Bounds on weak Roman and 2-rainbow domination numbers
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- On secure domination in graphs
- On the weak Roman domination number of lexicographic product graphs
- Vertex Covers and Secure Domination in Graphs
- Secure domination and secure total domination in graphs
- Protection of graphs with emphasis on Cartesian product graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Secure Italian domination in graphs