On Bondage Numbers of Graphs -- a survey with some comments

2012/04/18 by Jun‐Ming Xu, Xu, Jun-Ming · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1204.4010

openalex publication_date 2012/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The bondage number of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number of G. This lecture gives a survey on the bondage number, including the known results, problems and conjectures. We also summarize other types of bondage numbers.

Citations

• Roman domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Defend the Roman Empire!

Cited by

• The k-Total Bondage Number of a Graph

Related

• Note on the bondage number of graphs on topological surfaces
• The bondage number of random graphs
• The bondage number of (n-3)-regular graphs of order n
• On Total Bondage Number of Graphs
• The bondage number of chordal graphs