ON THE ROMAN BONDAGE NUMBER OF A GRAPH

DOI10.1142/S1793830913500018zbMath1268.05143arXiv1204.1438MaRDI QIDQ4928332

Fu-Tao Hu, A. Bahremandpour, Jun-Ming Xu, Seyyed Mahmoud Sheikholeslami

Publication date: 11 June 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

NP-hardnessRoman bondage numberRoman domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Characterization of trees with Roman bondage number 1 ⋮ Complexity and bounds for disjunctive total bondage ⋮ On the double Roman bondage numbers of graphs ⋮ Restrained Italian bondage number in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Unnamed Item ⋮ Roman \(\{2\}\)-bondage number of a graph ⋮ Roman Domination in Graphs ⋮ On the Roman domination subdivision number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the bondage and reinforcement problems
• A note on Roman domination in graphs
• Restrained bondage in graphs
• Efficient algorithms for Roman domination on some classes of graphs
• On the Roman domination number of a graph
• The bondage number of a graph
• On graphs with equal domination and covering numbers
• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• Roman dominating influence parameters
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
• Extremal Problems for Roman Domination
• Vertex domination-critical graphs
• Theory and Application of Graphs

This page was built for publication: ON THE ROMAN BONDAGE NUMBER OF A GRAPH