Weak Roman domination in rooted product graphs

DOI10.3934/math.2021217OpenAlexW3124156463MaRDI QIDQ2144851

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

Publication date: 17 June 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2021217

zbMATH Keywords

NP-hardrooted product graphsweak Roman dominationcorona product graphsprotection of graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Bounds on weak Roman and 2-rainbow domination numbers
• Constructive characterizations concerning weak Roman domination in trees
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
• Defending the Roman Empire---a new strategy
• Effect of vertex deletion on the weak Roman domination number of a graph
• On the super domination number of lexicographic product graphs
• On the weak Roman domination number of lexicographic product graphs
• Coloring rectangular blocks in 3-space
• Protection of graphs with emphasis on Cartesian product graphs
• Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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