BONDAGE NUMBER FOR JUMP GRAPH OF SOME TREES

Abstract

The dominating set of a graph is a vertex set in that every vertex which is not in the
dominating set is adjacent to at least one vertex of the dominating set. The domination number
is the minimal cardinality among all dominating sets. The bondage number of any graph is the
minimal cardinality among all sets of edges whose removal from the graph results in a graph
with domination number greater than the domination number of the preliminary graph. In this
paper, we investigate the bondage number for jump graph of some certain trees.