Protection of graphs with emphasis on Cartesian product graphs

DOI10.2298/FIL1901319VzbMath1499.05506arXiv2008.00225OpenAlexW2990668145WikidataQ126640370 ScholiaQ126640370MaRDI QIDQ5080300

Magdalena Valveny, Juan Alberto Rodríguez-Velázquez

Publication date: 31 May 2022

Published in: Filomat (Search for Journal in Brave)

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

zbMATH Keywords

Cartesian productweak Roman dominationsecure domination

Mathematics Subject Classification ID

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

Related Items (7)

Weak Roman domination in rooted product graphs ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ Secure domination in rooted product graphs ⋮ Secure Italian domination in graphs ⋮ Varieties of Roman Domination ⋮ Protection of lexicographic product graphs ⋮ The secure domination number of Cartesian products of small graphs with paths and cycles

Cites Work

• Bounds on weak Roman and 2-rainbow domination numbers
• Relations between packing and covering numbers of a tree
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• Dominating Cartesian products of cycles
• On secure domination in graphs
• On the weak Roman domination number of lexicographic product graphs
• Vizing's conjecture: a survey and recent results
• Vertex Covers and Secure Domination in Graphs
• Secure domination and secure total domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Protection of graphs with emphasis on Cartesian product graphs