Bondage number

Summary

In the mathematical field of graph theory, the bondage number of a nonempty graph G is the cardinality of the smallest set of edges whose removal results in a domination number strictly greater than the domination number γ(G) of G. The bondage number is denoted b(G).