Italian domination in the Cartesian product of paths
From MaRDI portal
Publication:2025085
DOI10.1007/s10878-020-00694-xzbMath1464.05287OpenAlexW3121873295MaRDI QIDQ2025085
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-00694-x
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Roman \(\{2 \}\)-domination
- The \(k\)-rainbow reinforcement numbers in graphs
- Italian domination in trees
- Rainbow domination in graphs
- Roman domination in graphs.
- Independent Roman \(\{2 \}\)-domination in graphs
- Weak \(\{2\}\)-domination number of Cartesian products of cycles
- Perfect Italian domination in trees
- 2-rainbow domination number of \(C_n\square C_5\)
- On the 2-rainbow domination in graphs
- Semi-slant Riemannian map
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: Italian domination in the Cartesian product of paths
