A new upper bound for the bondage number of graphs with small domination number

Let, of the domination number of graph. The bondage number G was first introduced by Fink, Jacobson, the minimum among all sets of holds. In this paper we show that for graph G satisfying