The bondage number of graphs:good and bad vertices
Vladimir Samodivkin · Discussiones Mathematicae Graph Theory · 2008
TheThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater then γ(G).In this paper we present new sharp upper bounds for b(G) in terms of γ-good and γ-bad vertices of G.