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

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.

80 page; 14 figures; 120 references

References in corpus (4)

• Upper bounds for the bondage number of graphs on topological surfaces
• Complexity of Bondage and Reinforcement
• Roman Bondage Numbers of Some Graphs
• An improved upper bound for the bondage number of graphs on surfaces