Bondage number

The concept of a "bondage number" typically arises in the context of graph theory. Specifically, the bondage number of a graph is defined as the minimum number of edges that must be removed from the graph in order to make it impossible to maintain a dominating set—that is, a set of vertices such that every vertex in the graph is either in the dominating set or is adjacent to a vertex in the dominating set—of a certain size.