Papers

The inverse bondage number b^-1(G) of a graph G to be the cardinality of a smallest set E' E of edges for which ^-1(G–E')>^-1(G). Thus, the inverse bondage number of G is the smallest number of edges whose removal will render every minimum inverse dominating set in G a “non inverse dominating set” set in the resultant spanning sub graph.