A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The domination number of a graph is the smallest number of vertices which dominate all remaining vertices by edges of . The bondage number of a nonempty graph is the smallest number of edges whose removal from results in a graph with domination number greater than the domination number of . The concept of the bondage number was formally introduced by Fink et al. in 1990. Since then, this topic has received considerable research attention and made some progress, variations, and generalizations.doi:10.1155/2013/595210 fatcat:6zg7jz7i5jenzc2e2izfdy2txq