Italian domination in rooted product graphs

DOI10.1007/s40840-020-00962-3zbMath1458.05196arXiv2006.02124OpenAlexW3101183505MaRDI QIDQ2227964

Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez

Publication date: 16 February 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.02124

zbMATH Keywords

NP-hard problemrooted product graphsItalian domination

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Approximation algorithm for (connected) Italian dominating function ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Italian domination in trees
• Roman domination in graphs.
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
• On the super domination number of lexicographic product graphs
• Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results

This page was built for publication: Italian domination in rooted product graphs