A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the inequality b(G) ≤ 2s − 2, provided G has degree s vertices. We also present upper bounds for the bondage number of graphs in terms of the girth, domination number and Euler characteristic. As a corollary we give a stronger bound than the known constant upper bounds for the bondage number of graphsdoi:10.5614/ejgta.2018.6.1.1 fatcat:6ohhgnnxb5gs7hblypg4j2xomu