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.
Copy the following to cite this article:
Y. K. M; N. Soner, "The inverse bondage number of a graph", Journal of Ultra Scientist of Physical Sciences, Volume 31, Issue 1, Page Number 1-3, 2019Copy the following to cite this URL:
Y. K. M; N. Soner, "The inverse bondage number of a graph", Journal of Ultra Scientist of Physical Sciences, Volume 31, Issue 1, Page Number 1-3, 2019Available from: https://www.ultrascientist.org/paper/1509/the-inverse-bondage-number-of-a-graph