Upper bounds for the bondage number of graphs on topological surfaces

Andrei Gagarin, Vadim Zverovich

The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that,…