scientific article
From MaRDI portal
Publication:3391333
zbMath1483.05114MaRDI QIDQ3391333
Publication date: 28 March 2022
Full work available at URL: https://cdm.ucalgary.ca/article/view/71109
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Italian domination in trees
- Independent Roman \(\{2 \}\)-domination in graphs
- Perfect Italian domination in trees
- Italian domination in rooted product graphs
- On graphs with equal domination and 2-domination numbers
- Dominating Sets in Chordal Graphs
- Total Roman {2}-domination in graphs
- Global italian domination in graphs
- A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers
This page was built for publication: