Bondage number
How many of a graph's edges must be removed to increase domination number From Wikipedia, the free encyclopedia
In the mathematical field of graph theory, the bondage number of a nonempty graph is the cardinality of the smallest set E of edges such that the domination number of the graph with the edges E removed is strictly greater than the domination number of the original graph.[1][2] The concept was introduced by Fink et al.[3]
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.