Roman \(\{2\}\)-bondage number of a graph

DOI10.7151/dmgt.2144zbMath1430.05089OpenAlexW2883471313MaRDI QIDQ2282478

Doost Ali Mojdeh, Ahmad Moradi, Omid Sharifi

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2144

zbMATH Keywords

dominationRoman \(\{2\}\)-dominationRoman \(\{2\}\)-bondage number

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)

Related Items (3)

On the computational complexity of Roman\(\{2\}\)-domination in grid graphs ⋮ Restrained Italian bondage number in graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Roman \(\{2 \}\)-domination
• The bondage number of a graph
• Roman domination in graphs.
• A note on the Roman bondage number of planar graphs
• 2-bondage in graphs
• Roman bondage in graphs
• On the average lower bondage number of a graph
• Weak Roman domination in graphs
• Extremal Problems for Roman Domination
• ON THE ROMAN BONDAGE NUMBER OF A GRAPH

This page was built for publication: Roman \(\{2\}\)-bondage number of a graph