From Italian domination in lexicographic product graphs to w-domination in graphs
From MaRDI portal
Publication:5066972
DOI10.26493/1855-3974.2318.fb9zbMath1486.05224arXiv2011.05371OpenAlexW3161019916MaRDI QIDQ5066972
Alejandro Estrada-Moreno, Abel Cabrera Martínez, Juan Alberto Rodríguez-Velázquez
Publication date: 31 March 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.05371
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Relating the total \(\{2\}\)-domination number with the total domination number of graphs
Cites Work
- Roman \(\{2 \}\)-domination
- Italian domination in trees
- \(k\)-tuple total domination in graphs
- Double domination in lexicographic product graphs
- On integer domination in graphs and Vizing-like problems
- Variations of \(Y\)-dominating functions on graphs
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- Generalized domination and efficient domination in graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
- Total Domination in Graphs
- Total Roman {2}-domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: From Italian domination in lexicographic product graphs to w-domination in graphs